#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000005

int ans = 0;
int n;
vector<int> c;
vector<long long> B(17,0);
void dfs(int b,long long cur){
int m = __builtin_popcount(b);
	{
		
		if(m==n){
			long long cc = 1LL;
			rep(i,50){
				if(cur%cc==0)ans = max(ans,i);
				else break;
				cc *= 2;
			}
			return;
		}
		else{
			if(cur % (1<<m) != 0)return;
			else ans = max(ans,m);
		}
	}

	rep(i,n){
		if((b>>i)&1)continue;
		//cout<<i<<endl;
		//cout<<c[i]<<endl;
		if(i!=0&&(((b>>(i-1))&1)==0)&&c[i]==c[i-1])continue;
		
		dfs(b|(1<<i),c[i]*B[m] + cur);
	}
	
	
}

int main(){
	
	cin>>n;
	//vector<int> c;
	rep(i,9){
		int t;
		cin>>t;
		
		rep(j,t)c.push_back(i+1);
	}
	
	B[0] = 1;
	rep(i,16){
		B[i+1] = B[i]*10;
	}
	
	dfs(0,0);
	cout<<ans<<endl;
	
	return 0;
}