#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  for (ll i = 0; i < v.size(); ++i) os << v[i] << " ";
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
  for (auto it : v) os << it << " ";
  return os;
}
template <typename T, typename S>
ostream& operator<<(ostream& os, const pair<T, S>& v) {
  os << v.first << " " << v.second;
  return os;
}
const ll mod = 1e9 + 7;
const ll inf = 2e18;
const ll ninf = -2e18;
ll takemod(ll a) { return ((a % mod) + mod) % mod; }
ll pow(ll a, ll b, ll m) {
  ll ans = 1;
  a %= m;
  while (b) {
    if (b & 1) ans = (ans * a) % m;
    b /= 2;
    a = (a * a) % m;
  }
  return ans;
}
ll modinv(ll a) { return takemod(pow(takemod(a), mod - 2, mod)); }
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  time_t t1, t2;
  t1 = clock();
  ll n;
  cin >> n;
  vector<ll> arr(n);
  bool tmp = 1;
  for (ll i = 0; i < n; i++) {
    cin >> arr[i];
    tmp &= arr[i];
  }
  if (tmp) {
    cout << "YES" << '\n';
    return 0;
  }
  set<ll> facts;
  for (ll i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      ll ot = n / i;
      facts.insert(i);
      facts.insert(ot);
    }
  }
  for (auto pf : facts) {
    ll skp = (n / pf) - 1;
    if (pf < 3) continue;
    for (ll i = 0; i <= skp; i++) {
      bool flag = true;
      for (ll j = i; j < n; j += (skp + 1)) {
        if (!arr[j]) {
          flag = false;
          break;
        }
      }
      if (flag) {
        cout << "YES" << '\n';
        return 0;
      }
    }
  }
  cout << "NO" << '\n';
  t2 = clock();
  cerr << '\n' << t2 - t1 << '\n';
  return 0;
}
