A queue $Q$ is implemented using two stacks $S_{in}$ and $S_{out}$. If each PUSH or POP with the stack has a cost of $\Theta(1)$, what is the amortized cost per operation over a sequence of $m$ legal queue operations, starting from an empty state with the first operation being ENQUEUE?