#include <cstdio>
#include <cstring>
#include <string>
#define MAXN 60000
using namespace std;

int C[MAXN], M[MAXN], A[MAXN], B[MAXN], nr[20], sum;
void mul(int A[], int B[])
 {
      int i, j, t;
      memset(C, 0, sizeof(C));
      for (i = 1; i <= A[0]; i++)
      {
              for (t=0, j=1; j <= B[0] || t; j++, t/=10)
                      C[i+j-1]=(t+=C[i+j-1]+A[i]*B[j])%10;
              if (i + j - 2 > C[0]) C[0] = i + j - 2;
      }

}
inline bool compare (int A[MAXN], int B[MAXN])
{
	if (A[0] > B[0]) return 1;
	if (B[0] > A[0]) return 0;
	for (int i = A[0]; i >= 1; i--)
	{
		if (A[i] > B[i])
			return 1;
		if (B[i] > A[i])
			return 0;
	}
	return 0;
}		
void cpy (int A[], int B[], int x)
{	
	int i;
	memset (A, 0, sizeof (A));
	for (i = 0; i <= x; i++)
		A[i] = B[i];
}
int main ()
{
	freopen ("prod.in", "r", stdin);
	freopen ("prod.out", "w", stdout);
	int i, aux, cif = 0;
	for (i = 1; i <= 9; i++)
		scanf ("%d", &nr[i]), sum += nr[i];
	for (i = 1; i <= 9; i++)
	{
		aux = nr[i];
		while (aux)
		{
			cif += 1;
			A[cif] = i;
			B[cif] = i;
			--aux;
		}
	}
	cif = 0;
	int tot = sum;
	while (sum)
	{
		--sum;
		++A[0];
		cif = 0;
		memset (B, 0, sizeof (B));
		for (i = A[0] + 1; i <= tot; i++)
			B[++cif] = A[i];
		B[0] = cif;
		mul (A, B);
		if (compare (C, M) == 1) cpy (M, C, C[0]);
	}
	for (i = M[0]; i >= 1; i--)
		printf ("%d", M[i]);
	return 0;
}