#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<unordered_map>
#include<map>

using ull = unsigned long long;
ull hah(vector<int>&c){
    const ull B = 998244353;
    ull sum = 0;
    ull now = 1;
    for(int i = 1;i<=9;i++){
        for(int j = 0;j<c[i];j++) {
            sum += i * now;
            now *= B;
        }
    }
    return sum;
}
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll n;
    cin>>n;
    vector<int> c(10,0);
    for(int i = 1;i<=9;i++) cin>>c[i];
    if(n==1){
        int ans = 0;
        for(int i = 1;i<=9;i++) ans += c[i];
        int cnt = 0;
        while(true){
            if(ans&1) break;
            ans >>= 1;
            cnt++;
        }
        cout<<cnt<<endl;
        return 0;
    }

    int cnt = 0;
    for(int kk = 47;kk>=30;kk--){
        ll k = 1ll << kk;
        while(true){
            string s = to_string(k);
            if(s.size()>n) break;
            if(s.size()<n){
                k += 1ll << kk;
                continue;
            }
            cnt++;
            vector<int> nc(10,0);
            for(int i = 0;i<s.size();i++){
                int ni = s[i] - '0';
                nc[ni]++;
            }
            if(c==nc){
                cout<<kk<<endl;
                return 0;
            }
            k += 1ll << kk;
        }
        //cout<<cnt<<endl;
    }
    for(int kk = 30;kk>=0;kk--){
        ll k = 1ll << kk;

        vector<ll> a,b;
        ll now = 1;
        for(int i = 0;i<n;i++){
            if(i%2==0) a.push_back(now);
            else b.push_back(now);
            now *= 10;
        }
        unordered_map<ull,unordered_map<ll,int>> m1,m2;
        vector<int> use(10,0);
        ll ans = 0;
        auto calc = [&](vector<int>&now) {
            vector<int> all;
            for(int i = 1;i<=9;i++) for(int j = 0;j<now[i];j++) all.push_back(i);
            sort(all.begin(),all.end());
            do{
                ll sum = 0;
                for(int i = 0;i<a.size();i++){
                    sum += a[i] * all[i];
                    sum %= k;
                }
                m1[hah(now)][sum]++;
            }while(next_permutation(all.begin(),all.end()));
            
        };

        auto calc1 = [&](vector<int>&now){
            vector<int> all;
            for(int i = 1;i<=9;i++) for(int j = 0;j<now[i];j++) all.push_back(i);
            sort(all.begin(),all.end());
            do{
                ll sum = 0;
                for(int i = 0;i<a.size();i++){
                    sum += a[i] * all[i];
                    sum %= k;
                }
                ll want = k - sum;
                want %= k;
                vector<int> nxt(10,0);
                for(int i = 1;i<=9;i++) nxt[i] = c[i] - now[i];
                ans += m2[hah(nxt)][want];
            }while(next_permutation(all.begin(),all.end()));
        };
        bool fn = false;
        auto dfs = [&](auto dfs,int ni,int res) -> void {
            if(res==0){
                if(!fn) calc(use);
                else calc1(use);
                return;
            }
            for(int i = ni;i<=9;i++){
                if(c[i]==0) continue;
                c[i]--;
                use[i]++;
                dfs(dfs,i,res-1);
                use[i]--;
                c[i]++;
            }
        };
        dfs(dfs,1,a.size());
        swap(a,b);
        fn = true;
        swap(m1,m2);
        dfs(dfs,1,a.size());

        // for(auto itr:m1){
        //     auto use = itr.first;
        //     vector<int> want(10,0);
        //     for(int i = 1;i<=9;i++) want[i] = c[i] - use[i];
        //     auto now = m2[hah(want)];
        //     for(auto nn:itr.second){
        //         ll w = k - nn.first;
        //         w %= k;
        //         if(w<0) w += k;
        //         ans += nn.second * now[w];
        //     }
        // }
        if(ans==0) continue;

        cout<<kk<<endl;
        return 0;
    }


}