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 C# (Mono 4.6.2.0) (judge verdict: Time Limit Exceeded)

using System;
using System.Linq;
using System.Collections.Generic;
using System.Text.RegularExpressions;
using System.Text;
 
public class Program
{
    public void Proc() {
        Reader.IsDebug = false;
        long inputCount = int.Parse(Reader.ReadLine());
        this.Items = Reader.GetLongs();
        long sum = this.Items.Sum();
        long num = inputCount*(inputCount+1)/2;
 
        if(sum%num!=0) {
            Console.WriteLine("NO");
            return;
        }

        bool ans = true;
        for(int i=1; i<Items.Length; i++) {
            if(!IsCorrect(Items[i-1], Items[i], (int)(sum/num))) {
                ans = false;
                break;
            }
        }

        Console.WriteLine(ans?"YES":"NO");
    }

    private long[] Items;
 
    private bool IsCorrect(long num1, long num2, int remain) {
        if(remain == 0) {
            return (num1 ==0 && num2 == 0);
        }
        if(num1+remain == num2) {
            return true;
        }
        if(num1+remain > num2) {
            return IsCorrect(num1-this.Items.Length, num2-1, remain-1);
        }
        return false;
    }
 
    public class Reader {
        public static bool IsDebug = true;
 
        public static long[] GetLongs(char delimiter) {
            string inpt = Reader.ReadLine();
            return inpt.Split(delimiter).Select(a=>long.Parse(a)).ToArray();
        }
 
        public static long[] GetLongs() {
            return GetLongs(' ');
        }
        private static System.IO.StringReader SReader;
        private static string InitText = @"


4
1 2 3 1

";
        public static string ReadLine() {
            if(IsDebug) {
                if(SReader == null) {
                    SReader = new System.IO.StringReader(InitText.Trim());
                }
                return SReader.ReadLine();
            } else {
                return Console.ReadLine();
            }
        }
    }
    public static void Main(string[] args)
    {
        Program prg = new Program();
        prg.Proc();
    }
}