#include <cstdio>
#include <cstring>
#include <string>
#define MAXN 6000
#define BASE 10
using namespace std;

int  M[MAXN], A[MAXN], B[MAXN], rezA[MAXN], rezB[MAXN], AA[MAXN], BB[MAXN], nr[20], sum;
void mul(int A[], int B[])
{
      int i, j, t, C[MAXN];
      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;
      }
      memcpy(A, C, sizeof(C));
}

void sub(int A[], int B[])
{
      int i, t = 0;
      for (i = 1; i <= A[0]; i++)
              A[i] += (t = (A[i] -= ((i <= B[0]) ? B[i] : 0) + t) < 0) * BASE;
      for (; A[0] > 1 && !A[A[0]]; A[0]--);
}
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];
	M[0] = 10000000;
	for (i = 1; i <= 9; i++)
	{
		aux = nr[i];
		while (aux)
		{
			cif += 1;
			A[cif] = i;
			B[cif] = i;
			--aux;
		}
	}
	B[0] = sum;
	A[0] = 0;
	while (sum)
	{
		--sum;
		A[++A[0]] = B[1];
		--B[0];
		for (i = 1; i <= B[0]; i++)
			B[i] = B[i + 1];
		for (i = A[0]; i >= 0; i--)
			AA[i] = A[i];
		for (i = B[0] ; i >= 0 ; i--)
			BB[i] = B[i];
		if (compare (BB, AA) == 1)
		{
			sub (BB, AA);
			if (compare (M, BB) == 1) 
			{
				cpy (M, BB, BB[0]);
				cpy (rezA, B, B[0]);
				cpy (rezB, A, A[0]);
			}
		} else {
			sub (AA, BB);
			if (compare (M, AA) == 1)
			{
				cpy (M, AA, AA[0]);
				cpy (rezA, A, A[0]);
				cpy (rezB, B, B[0]);
			}
		}
	}
	mul (rezA, rezB);
	for (i = rezA[0]; i >= 1; i--)
		printf ("%d", rezA[i]);
	return 0;
}