Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Ice Sculptures

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe Berland University is preparing to celebrate the 256-th anniversary of its founding! A specially appointed Vice Rector for the celebration prepares to decorate the campus. In the center of the campus *n* ice sculptures were erected. The sculptures are arranged in a circle at equal distances from each other, so they form a regular *n*-gon. They are numbered in clockwise order with numbers from 1 to *n*.

The site of the University has already conducted a voting that estimated each sculpture's characteristic of *t*_{i} — the degree of the sculpture's attractiveness. The values of *t*_{i} can be positive, negative or zero.

When the university rector came to evaluate the work, he said that this might be not the perfect arrangement. He suggested to melt some of the sculptures so that:

- the remaining sculptures form a regular polygon (the number of vertices should be between 3 and
*n*), - the sum of the
*t*_{i}values of the remaining sculptures is maximized.

Help the Vice Rector to analyze the criticism — find the maximum value of *t*_{i} sum which can be obtained in this way. It is allowed not to melt any sculptures at all. The sculptures can not be moved.

Input

The first input line contains an integer *n* (3 ≤ *n* ≤ 20000) — the initial number of sculptures. The second line contains a sequence of integers *t*_{1}, *t*_{2}, ..., *t*_{n}, *t*_{i} — the degree of the *i*-th sculpture's attractiveness ( - 1000 ≤ *t*_{i} ≤ 1000). The numbers on the line are separated by spaces.

Output

Print the required maximum sum of the sculptures' attractiveness.

Examples

Input

8

1 2 -3 4 -5 5 2 3

Output

14

Input

6

1 -2 3 -4 5 -6

Output

9

Input

6

1 2 3 4 5 6

Output

21

Note

In the first sample it is best to leave every second sculpture, that is, leave sculptures with attractivenesses: 2, 4, 5 и 3.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/23/2017 11:09:39 (c3).

Desktop version, switch to mobile version.
User lists

Name |
---|