#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
// const int MOD = 1000000007;
const int MOD = 998244353;

int main() {
    int N;
    cin >> N;

    vector<int> c(10);
    rep2(i, 1, 10) cin >> c[i];

    int K = 9;
    if (N <= K) {
        vector<int> v;
        rep(i, 10) rep(j, c[i]) v.eb(i);
        int ans = -inf;
        do {
            ll x = 0;
            per(i, N) {
                x *= 10;
                x += v[i];
            }
            int tmp = 0;
            while (x % 2 == 0) x /= 2, tmp++;
            chmax(ans, tmp);
        } while (next_permutation(all(v)));
        cout << ans << '\n';
        return 0;
    }

    vector<ll> pw(19, 1);
    rep(i, 18) pw[i + 1] = pw[i] * 10;

    int ans = 0;
    vector<pair<int, vector<int>>> tmp;
    per2(i, 1, K + 1) {
        vector<int> d(10, 0);
        for (int j = 0; j < pw[i]; j += (1 << i)) {
            fill(all(d), 0);
            int memo = j;
            rep(t, i) {
                d[memo % 10]++;
                memo /= 10;
            }
            bool flag = true;
            rep(k, 10) {
                if (c[k] < d[k]) flag = false;
            }
            if (flag) {
                ans = i;
                if (i == K) tmp.eb(j, d);
            }
        }
        if (ans != 0) break;
    }
    // cout << ans << '\n';

    if (ans != K) {
        cout << ans << '\n';
        return 0;
    }

    for (auto [t, e] : tmp) {
        vector<int> v;
        rep(i, 10) rep(j, c[i] - e[i]) v.eb(i);
        do {
            ll x = 0;
            per(i, N - K) {
                x *= 10;
                x += v[i];
            }
            x *= pw[K], x += t;
            int cnt = 0;
            while (x % 2 == 0) x /= 2, cnt++;
            chmax(ans, cnt);
        } while (next_permutation(all(v)));
    }

    cout << ans << '\n';
}