Five items $\text{A, B, C, D, E}$ are pushed onto a stack, one after other starting from item $\mathrm{A}$. The stack is then popped by three items, and each item is inserted into a queue. Next, two items are deleted from the queue, and the deleted items are pushed back onto the stack. Now, one item is popped from the stack. Which item is at the top of the stack.