#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <string>

#define ll long long

using namespace std;

int main()
{
	int n;
	cin >> n;
	vector<int> v(n);
	int sum = 0;
	for (int i = 0; i < n; ++i)
	{
		cin >> v[i];
		sum += v[i];
	}

	if (n < 6)
	{
		cout << sum;
		return 0;
	}

	for (int i = 2; i * i <= n; ++i)
	{
		if (n % i == 0)
		{
			for (int k = 0; k < i; ++k)
			{
				int cur_sum = 0;
				for (int j = k; j < n; j += i)
				{
					cur_sum += v[j];
				}
				sum = max(sum, cur_sum);
			}
		}
	}

	cout << sum;
}