Kertoma

#include "bits/stdc++.h"
#define int long long
 
using namespace std;
 
void init_code() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
} 
 
int f(int num){
   if (num < 0){
      return 0;
   }
   if (num <= 1){
      return 1;
   }
   double d = 0;
   for (int i=2; i<=num; i++){
      d += log10(i);
   }
   return floor(d) + 1;
}
 
void solve() {
  vector<int> a(10);
  int n = 0;
  for (int i = 0; i < 10; ++i) {
    cin >> a[i];
    n += a[i];
  }
  if (n == 1) {
    if (a[2] == 1) cout << 2 << '\n';
    else cout << 3 << '\n';
  } else if (n == 3) {
    if (a[7]) cout << 6 << '\n';
    else cout << 5 << '\n';
  } else {
    int l = 1, r = 1e7 + 1, m;
    while (r - l > 1) {
      m = (r + l) / 2;
      if (f(m) < n) {
        l = m;
      } else {
        r = m;
      }
    }
    cout << r << '\n';
  }
}
 
signed main() {
  init_code();
  int t = 1;
  //cin >> t;
  while (t--) {
    solve();  
  }
  return 0;
}
 
/*
 
 
vector<pair<int, int>> moves = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
  int n, m;
  cin >> n >> m;
 
  char x;
  pair<int,int> sa, sb;
 
  vector<vector<int>> a(n, vector<int> (m));
  for (int i = 0; i < n; ++i){
     for (int j = 0; j < m; ++j) {
       cin >> x;
       if (x == '#') { 
        a[i][j] = 0;
       } else if (x == '.'){
        a[i][j] = 1;
       } else if (x == 'A'){
        a[i][j] = 2;
        sa = {i, j};
       } else if (x == 'B'){
        a[i][j] = 3;
        sb = {i, j};
       }
     }
  }
  vector<vector<int>> used(n, vector<int> (m));
  used[sa.first][sa.second] = 1; used[sb.first][sb.second] = 2;
  
  set<pair<int, int>> q;
  q.insert(sa);
 
  pair<int, int> v;
  
  vector<pair<int, int>> 
  while (!q.empty()) {
    v = *q.begin();
    q.erase(q.begin());
    for (auto mv : moves) {
        int x = v.first + mv.first, y = v.second + mv.second;
        if (x >= 0 && x < n && y >= 0 && y < m && a[x][y] == 1 && used[x][y] == 0) {
          used[x][y] = 1;
          q.insert({x, y});
        }
    }
  }
 
  q.insert(sb);
  while (!q.empty()) {
    v = *q.begin();
    q.erase(q.begin());
    for (auto mv : moves) {
        int x = v.first + mv.first, y = v.second + mv.second;
        if (x >= 0 && x < n && y >= 0 && y < m && a[x][y] == 1 && used[x][y] == 0) {
          used[x][y] = 2;
          q.insert({x, y});
        } else if (x >= 0 && x < n && y >= 0 && y < m && a[x][y] == 1 && used[x][y] == 1) {
          cout << 1 << '\n';
          return;
        }
    }
  }
 
  for (int i = 0; i < ; ++i) {
    
  }
*/

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

Test 7

Group: 2, 3

Verdict: ACCEPTED

Test 8

Group: 2, 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 2, 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED