#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>

using namespace std;

int mat[208][208];
int dp[208][208];

int main()
{
    /*int n, k;
    scanf("%d %d", &n, &k);

    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++) scanf("%d", &mat[i][j]);

    int a, b;
    scanf("%d %d", &a, &b);
    a--;
    b--;

    dp[a][b + 1] =
    dp[a + 1][b] =
    dp[a][b - 1] =
    dp[a - 1][b] =

    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++) printf("%d ", dp[i][j]);
        cout << endl;
    }

    for(int i = 0; i < k; i++)
    {
        int x, y;
        scanf("%d %d", &x, &y);
        printf("%d\n", dp[x-1][y-1]);
    }*/

    freopen("symbol.in", "r", stdin);
    freopen("symbol.out", "w", stdout);

    pair<int, char> a[5];
    pair<int, string> b[5];

    for(int i = 0; i < 5; i++)
        {
            cin >> a[i].first >>a[i].second;
            b[i].first = a[i].first;
        }

    for(int i = 0; i < 5; i++)
    {
        for(int j = 0; j < a[i].first; j++) b[i].second += a[i].second;
    }

    sort(b, b + 5);

    for(int i = 0; i < 5; i++) cout << b[i].second << endl;
}