#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
#include<vector>
using namespace std;
typedef long long ll;
pair<int, char> p[6];
int main()
{
    freopen("symbol.in","r",stdin);
    freopen("symbol.out","w",stdout);
    for(int i=1;i<=5;i++)
    {
        cin>>p[i].first>>p[i].second;
    }
    sort(p+1,p+6);
    for(int i=1;i<=5;i++)
    {
        for(int j=1;j<=p[i].first;j++)
            cout<<p[i].second;
        cout<<endl;
    }
    return 0;
}
/*
1 !
4 $
5 %
3 #
2 @
*/