A hillside road has n houses built in a row, numbered 1 to n starting from the base of the hill. Each house has a recorded elevation. A house is designated a checkpoint if its position number evenly divides the total number of houses n (that is, n modulo the position is exactly zero). For a road inspection report you need the sum of the squared elevations of all checkpoint houses.

Given the elevations of all n houses, compute the sum of the squares of the elevations at every checkpoint position.

Input format

Line 1: a single integer n, the number of houses. Line 2: n space-separated integers, where the i-th integer (1-indexed) is the elevation of the house at position i.

Output format

Print a single integer: the sum of the squares of the elevations of every position i (1 <= i <= n) for which n is divisible by i.

Constraints

1 <= n <= 100 1 <= elevation <= 100 for every house All values are integers.

5
1 2 3 4 5

26

6
2 3 4 10 5 7

78