#include <bits/stdc++.h>
using namespace std;
string vow = "aeiou";
int month[] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int dxhorse[] = {-2, -2, -1, -1, 1, 1, 2, 2};
const int dyhorse[] = {1, -1, 2, -2, 2, -2, 1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const long double pie = 3.1415926535897932384626;
const long long mod = 1e9 + 7;
void solve(int test_case) {
  int n;
  cin >> n;
  vector<int> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  vector<int> div;
  for (int d = 1; d * d <= n; d++) {
    if (n % d) continue;
    ;
    int d1 = n / d;
    int d2 = d;
    div.push_back(d1);
    if (d1 != d2) div.push_back(d2);
  }
  int ans = 0;
  for (auto i : v) ans += i;
  for (auto d : div) {
    int take = n / d;
    if (take < 3) continue;
    ;
    for (int i = 0; i < d; i++) {
      int s = 0;
      for (int j = i; j < n; j += d) s += v[j];
      ans = max(ans, s);
    }
  }
  cout << ans;
  cout << "\n";
  ;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  for (int i = 1; i <= t; i++) solve(i);
  return 0;
}
