#include<fstream>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<queue>
using namespace std;
ifstream fin("boss.in");
ofstream fout("boss.out");
class xxx{
public:
	string name,r;
};
xxx g[10000];
int n,k[10000];
bool cmp(xxx a,xxx b){
	string s,t;s=a.r;t=b.r;
	if (s.length()==t.length())
		return s>t;
		else
        return(s.length()>t.length());
}
int main(){
	fin>>n;
	for(int i=1;i<=n;i++)
		fin>>g[i].name>>g[i].r;
	sort(g+1,g+n+1,cmp);
    for(int i=1;i<=n;i++)
	fout<<g[i].name<<endl;
	for(int i=1;i<492;i++){
		for(int j=1;j<=n;j++){
			string z;int y;
			z=g[j].r;
			y=z.length();
			if(y>=i){
				k[i]=k[i]+z[y-i]-'0';}
			
		}
		k[i+1]=k[i]/10;
		k[i]=k[i]%10;
	}

	for(int i=490;i>0;i--)
	{
		
		fout<<k[i];
	}

	return 0;
}