#include <bits/stdc++.h>

// #define int int64_t

const int kMaxN = 105;

int n;
int a[kMaxN];

namespace Sub1 {
const int kMaxS = 1e6 + 5;

bool f[kMaxS];

void solve() {
  std::fill_n(f, kMaxS, 0);
  f[0] = 1;
  int d = 0;
  int64_t sum = 0;
  for (int i = 1; i <= n; ++i) {
    if (a[i]) d = std::__gcd(d, i);
    sum += 1ll * i * a[i];
  }
  if (!d) return void(std::cout << "1\n");
  for (int i = 1; i <= n; ++i) {
    static int lst[kMaxN];
    std::fill_n(lst, i, -1);
    for (int j = 0; j <= 1e6; ++j) {
      if (f[j]) lst[j % i] = j;
      if (lst[j % i] != -1 && (j - lst[j % i]) / i <= a[i]) f[j] = 1;
    }
  }
  int64_t ans = 0;
  for (int i = 0; i <= 1e6; ++i) ans += f[i];
  if (sum > 1e6) ans += sum / d - 1000000 / d;
  std::cout << ans << '\n';
}
} // namespace Sub1

void dickdreamer() {
  for (int i = 1; i <= n; ++i) std::cin >> a[i];
  Sub1::solve();
}

int32_t main() {
#ifdef ORZXKR
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
#endif
  std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
  int T = 1;
  // std::cin >> T;
  while (std::cin >> n) dickdreamer();
  // std::cerr << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
  return 0;
}