Problem:
Score : 500 points

Problem Statement

There are N boxes arranged in a circle. The i-th box contains A_i stones.

Determine whether it is possible to remove all the stones from the boxes by repeatedly performing the following operation:

Select one box. Let the box be the i-th box. Then, for each j from 1 through N, remove exactly j stones from the (i+j)-th box. Here, the (N+k)-th box is identified with the k-th box.

Note that the operation cannot be performed if there is a box that does not contain enough number of stones to be removed.

Constraints

1 ≦ N ≦ 10^5

1 ≦ A_i ≦ 10^9

Input

The input is given from Standard Input in the following format:

N
A_1 A_2 … A_N

Output

If it is possible to remove all the stones from the boxes, print YES. Otherwise, print NO.

Sample Input 1

5
4 5 1 2 3

Sample Output 1

YES

All the stones can be removed in one operation by selecting the second box.

Sample Input 2

5
6 9 12 10 8

Sample Output 2

YES

Sample Input 3

4
1 2 3 1

Sample Output 3

NO

Solution in Kotlin (1.0.0) (judge verdict: Wrong Answer)

import java.util.*

fun main(args: Array<String>) {
    val DEBUG = false
    val scanner = Scanner(System.`in`)
    val N = scanner.nextLong()
    val AN: LongArray = (0..N.toInt() - 1).map { scanner.nextLong() }.toLongArray()
    val sum: Long = AN.sum()
    val once = (N * (N + 1)) / 2
    if (sum % once != 0L || sum % N != 0L) {
        println("NO")
        return
    }
    val k: Long = sum / once
    val d = (1..N.toInt() ).map { index -> AN[(index % N).toInt()] - AN[index - 1] - k }.toLongArray()
    var count: Long = 0
    (0..N - 1).forEach { i ->
        while (d[i.toInt()] < 0) {
            d[i.toInt()] += N
            count += 1
        }
        if (d[i.toInt()] != 0L) {
            if (DEBUG) println("d[$i]=${d[i.toInt()]}")
            println("NO")
            return
        }

    }
    if (k == count) println("YES")
    else {
        if (DEBUG) println("k=$k ,count=$count")
        println("NO")
    }
}