#include<iostream> using namespace std; int ans=0; int N,K; int C[10]; void dfs(int id,long now,long p) { if(id==N) { while(now>0&&now%2==0)now/=2,id++; if(ans<id)ans=id; return; } if(ans<id)ans=id; for(int i=1;i<=9;i++)if(C[i]&&(now+p*i)%2==0) { C[i]--; dfs(id+1,(now+p*i)/2,p*5); C[i]++; } } main() { cin>>N; for(int i=1;i<=9;i++)cin>>C[i]; dfs(0,0,1); cout<<ans<<endl; }