#include <algorithm>
#include <queue>
#include <iostream>

#include <stdio.h>

using namespace std;

typedef struct {
	int index;
	char data[256];
} MYNODE, *PMYNODE;

int main()
{
	
	queue<MYNODE> testdata;

	//構造queue
	int i = 0;
	while (true)
	{
		MYNODE tmpnode;
		
		if (scanf("%d, %s", &(tmpnode.index), &(tmpnode.data)) != 2)
			break;

		testdata.push(tmpnode);
		
		i++;
	}

	cout<<"\nSize:"<<testdata.size()<<endl;

	cout<<"Press any key to pop a NODE..."<<endl;
	//彈出queue
	while (!testdata.empty())
	{
		getchar();
	
		cout<<testdata.front().index<<"--"<<testdata.front().data<<endl;
		testdata.pop();

		cout<<"Size:"<<testdata.size()<<endl;
	}
	

	//打印vector大小
	cout<<"Size:"<<testdata.size()<<endl;
}