find min operation in amortized O(1) time on two stack version of FIFO Queue?

Question

I search lots of SO question and answer and seen we can implement Add and Remove from queue in O(1) amortized time, with two stack implementation of FIFO Queue. never seen i