#include <algorithm>
#include <map>
#include <iostream>

#include <stdio.h>

using namespace std;

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


//map構造比較函數
struct compare{
	bool operator()(int node1index, int node2index) const
	{
		return (node1index < node2index);
	}
};

int main()
{
	
	map<int, MYNODE, compare> testdata;

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

		testdata[tmpnode.index] = tmpnode;
		
		i++;
	}

	cout<<"\n"<<endl;

	//遍歷map
	map<int, MYNODE, compare>::iterator it;
	for (it=testdata.begin(); it!=testdata.end(); it++)
	{
		cout<<(*it).second.index<<"--"<<(*it).second.data<<endl;
	}

	cout<<"\n"<<endl;

	//改變map中NODE值
	MYNODE tmpnode;
	tmpnode.index = 9999;
	strcpy(tmpnode.data, "HelloWorld!");

	testdata[100] = tmpnode;

	//遍歷map
	for (it=testdata.begin(); it!=testdata.end(); it++)
	{
		cout<<(*it).second.index<<"--"<<(*it).second.data<<endl;
	}
	

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