#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("prod.in");
ofstream fout("prod.out");
int fr[11], A[1009], B[1009], C[10009];

inline int Comp()
{
	if (A[0] > B[0]) return 1;
	else if (A[0] < B[0]) return -1;
	for (int i=1; i<=A[0]; i++)
	{
		if (A[i] > B[i]) return 1;
		else if (A[i] < B[i]) return -1;
	}
	return 0;
}

inline void Prod()
{
	int i, j, t = 0;
	C[0] = A[0] + B[0] - 1;
	for (i=1; i<=A[0]; i++)
	{
		for (j=1; j<=B[0]; j++)
		{
			C[i+j-1] += A[i] * B[j];
		}
	}
	for (i=1; i<=C[0]; i++)
	{
		t = (C[i] += t) / 10;
		C[i] %= 10;
	}
	if (t) C[++C[0]] = t;
}

int main()
{
	for (int i=1; i<=9; i++) fin >> fr[i];
	for (int i=9; i>=1; i--)
	{
		while (fr[i])
		{
			if (Comp() < 0) A[0]++, A[A[0]] = i;
			else B[0]++, B[B[0]] = i;
			fr[i]--;
		}
	}
	
	reverse(A+1, A+1+A[0]);
	reverse(B+1, B+1+B[0]);
	
	Prod();
	for (int i=C[0]; i>=1; i--) fout << C[i];
	fout << '\n';
	fout.close();
	return 0;
	
}