#include <bits/stdc++.h>
using namespace std;
int dfs(vector<int> &A, int S, int d, long long x){
  int N = A.size();
  if (d == N){
    return __builtin_ctzll(x);
  } else {
    int ans = d;
    long long a = 1;
    for (int i = 0; i < d; i++){
      a *= 10;
    }
    for (int i = 0; i < N; i++){
      if ((S >> i & 1) == 0){
        long long x2 = x + A[i] * a;
        if (__builtin_ctzll(x2) >= d + 1){
          ans = max(ans, dfs(A, S + (1 << i), d + 1, x2));
        }
      }
    }
    return ans;
  }
}
int main(){
  int N;
  cin >> N;
  vector<int> c(10);
  c[0] = 0;
  for (int i = 1; i < 10; i++){
    cin >> c[i];
  }
  vector<int> A;
  for (int i = 1; i < 10; i++){
    for (int j = 0; j < c[i]; j++){
      A.push_back(i);
    }
  }
  cout << dfs(A, 0, 0, 0) << endl;
}