Consider an initially empty queue of English words. It allows four operations - enqueue, dequeue, head and tail. The operation enqueue adds its input to the rear of the queue. The dequeue operation removes the element at the front of the queue. The head and tail operations print the element at the front and rear of the queue data structure respectively. Let us consider the following operations (separated by semicolons) on the queue.

enqueue albert; head; enqueue einstein; tail; enqueue famously; enqueue said; head; enqueue it; enqueue is; dequeue; dequeue; tail; tail; enqueue not; enqueue so; enqueue very; enqueue important; enqueue for; head; enqueue a; head; enqueue person; head; enqueue to; enqueue learn; dequeue; enqueue facts; enqueue for; enqueue that; enqueue they; enqueue do; enqueue not; enqueue really; enqueue need; enqueue a; enqueue university; dequeue;

At this point, we keep doing the operation dequeue on the queue, to get the following output.

"itisnotsoveryimportantforapersontolearnfactsforthattheydonotreallyneedauniversity"

This is where the first phase ends and the queue is empty.

In the second phase, the following operations are conducted on the queue.

head; tail; enqueue Einstein; enqueue added; enqueue that; head; enqueue the; enqueue value; tail; enqueue of; enqueue education; dequeue; enqueue is; tail; enqueue not; enqueue in; enqueue the; enqueue learning; enqueue of; enqueue many; head; enqueue facts; enqueue but; enqueue the; head; enqueue training; dequeue; enqueue of; enqueue the; enqueue mind; enqueue to; tail; head; enqueue think; enqueue something; enqueue that; enqueue cannot; enqueue be; head; tail; enqueue learned; enqueue from; enqueue textbooks; head; dequeue; tail;

What will be the output henceforth, if we continue executing only the operation dequeue on the queue?

(Please ignore all outputs until this point. In your answer, please exclude all spaces, quotation marks or any additional character other than the words from the stack.)