Max Stack of Glyphs

The Codetikki masons stack glyphs one on top of another. They need a special stack that, in addition to push and pop, can return the maximum value currently in the stack ÔÇö all in constant time. Implement a max stack with operations: push x (push value x), pop (remove and print top), max (print current maximum). Input: first line n (number of operations), then n lines each containing an operation. Output: results of pop and max operations, one per line.