#include <fstream>
#include <algorithm>

using namespace std;

typedef struct
{
	int num;
	char ch;
} symbol;

symbol a[5];

bool comp(const symbol &lhs, const symbol &rhs)
{
	if(lhs.num < rhs.num)
	{
		return 1;
	}
	else if (lhs.num == rhs.num)
	{
		if(lhs.ch <= rhs.ch)
		{
			return 1;
		}
		return 0;
	}
	return 0;
}

int main()
{
	ifstream inp;
	inp.open("symbol.in");
	
	for(int i = 0; i < 5; ++i)
	{
		inp >> a[i].num >> a[i].ch;
	}
	
	sort(a, a + 5, comp);
	
	inp.close();
	ofstream out;
	out.open("symbol.out");
	
	for(int i = 0; i < 5; ++i)
	{
		for(int j = 0; j < a[i].num; ++j)
		{
			out << a[i].ch;
		}
		out << endl;
	}
	
	out.close();
	
	return 0;
}