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

int  M[MAXN], cur, 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];
}
void do_for (int A[], int B[])
{
	for (int i = ++B[0]; i >= 2; i--)
		B[i] = B[i - 1];
	B[1] = cur;
}
void afis (int A[])
{
	for (int i = A[0]; i >= 1; i--) printf ("%d", A[i]);
	printf ("\n");
}
int main ()
{
	freopen ("prod.in", "r", stdin);
	freopen ("prod.out", "w", stdout);
	int i;
	for (i = 1; i <= 9; i++)
		scanf ("%d", &nr[i]), sum += nr[i];
	M[0] = 10000000;
	int a = 0,b = 0;
	for (i = 9; i >= 1 && !b; i--)
	{	
		if (nr[i] && !a)
		{
			A[1] = i;
		       	--nr[i];
		       	a = 1;
		}
		if (nr[i] && a)
		{
			B[1] = i;
		       	--nr[i];
		       	b = 1;
		}
	
	}
	cur = 9;
	sum -= 2;
	A[0] = 1; B[0] = 1;
	while (sum)
	{
//		afis (A), afis (B);
		//printf ("%d\n", cur);
		while (nr[cur] == 0) --cur;
		--sum;
		--nr[cur];
		if (compare (A, B))
			do_for (A, B);
		else do_for (B, A);
//		printf ("%d\n", cur);
	}
	mul (A, B);
	for (i = A[0]; i >= 1; i--)
		printf ("%d", A[i]);
	return 0;
}