Data Structures: Stacks

Let $S$ and $T$ be stacks. Suppose $S$ contains the elements $1,2,3,4,5$ in that order, with $1$ on top and $5$ on the bottom. Now suppose the following piece of code is called:

while(!is_empty(S)) push(T,pop(S));

Here is_empty(S) checks to see whether S is an empty stack, pop(S) removes the top element from S, and push(T, e) pushes the element e onto the stack T.

What elements, and in what order, will be stored inside the stack T after this program has finished execution?