Consider a variant of a stack in which each operation involves popping one item followed by pushing n>= 0 items. Say stack is implemented using an array of fix size S, and the number of items in stack is never more than S.

Using potential function method show that the amortized cost of each operation is atmost 2.