#include<cstdio>
#include<fstream>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
using namespace std;
ifstream fi("boss.in");
ofstream fo("boss.out");
int N;
class Hint
{
public:
	string name;
	string d;
}p[1010];
inline bool operator >(Hint x,Hint y)
{
	if(x.d.length()!=y.d.length())return x.d.length()>y.d.length();
	int k=0,len=x.d.length();
	while(k<len)
	{
		if(x.d[k]!=y.d[k])return x.d[k]>y.d[k];
		k++;
	}
	return x.name<y.name;
}
bool cmp(Hint x,Hint y){return x>y;}
Hint operator +(Hint &x,Hint &y)
{
	Hint ans;
	int len=max(x.d.length(),y.d.length());
	while(x.d.length()<len)x.d="0"+x.d;
	while(y.d.length()<len)y.d="0"+y.d;
	//fo<<x.d<<' '<<y.d<<endl;
	int temp,tempx,tempy,addin=0;
	char tmp;
	for(int i=len-1;i>=0;i--)
	{
		tempx=x.d[i]-'0';tempy=y.d[i]-'0';
		temp=tempx+tempy+addin;
		tmp=(temp%10)+'0';
		ans.d=tmp+ans.d;
		addin=temp/10;
	}
	tmp=addin+'0';
	if(addin)ans.d=tmp+ans.d;
	//fo<<ans.d<<endl;
	return ans;
}
void output(Hint x)
{
	int i;
	for(i=490;i>x.d.length();i--)
	{
		fo<<0;
	}
	for(i=0;i<x.d.length();i++)
		fo<<x.d[i]-'0';
	fo<<endl;
}
int main()
{
	//freopen("boss.in","r",stdin);
	//freopen("boss.out","w",stdout);
	string temp;
	fi>>N;
	for(int i=1;i<=N;i++)
		fi>>p[i].name>>p[i].d;
	sort(p+1,p+N+1,cmp);
	for(int i=1;i<=N;i++)
		fo<<p[i].name<<endl;
	Hint Ans=p[1];
	for(int i=2;i<=N;i++)
		Ans=Ans+p[i];
	output(Ans);
	return 0;
}