Andrewid the Android is a galaxy-famous detective. He is now investigating a case of frauds who make fake copies of the famous Stolp's gears, puzzles that are as famous as the Rubik's cube once was.

Its most important components are a button and a line of *n* similar gears. Each gear has *n* teeth containing all numbers from 0 to *n* - 1 in the counter-clockwise order. When you push a button, the first gear rotates clockwise, then the second gear rotates counter-clockwise, the the third gear rotates clockwise an so on.

Besides, each gear has exactly one active tooth. When a gear turns, a new active tooth is the one following after the current active tooth according to the direction of the rotation. For example, if *n* = 5, and the active tooth is the one containing number 0, then clockwise rotation makes the tooth with number 1 active, or the counter-clockwise rotating makes the tooth number 4 active.

Andrewid remembers that the real puzzle has the following property: you can push the button multiple times in such a way that in the end the numbers on the active teeth of the gears from first to last form sequence 0, 1, 2, ..., *n* - 1. Write a program that determines whether the given puzzle is real or fake.
The first line contains integer *n* (1 ≤ *n* ≤ 1000) — the number of gears.

The second line contains *n* digits *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (0 ≤ *a*<sub class="lower-index">*i*</sub> ≤ *n* - 1) — the sequence of active teeth: the active tooth of the *i*-th gear contains number *a*<sub class="lower-index">*i*</sub>.
# import math
from collections import Counter, deque, defaultdict
# from math import *

from bisect import bisect_right

MOD = 1000000007


# from functools import reduce
# from itertools import permutations
# import queue


def solve():
    n = int(input())
    a = list(map(int, input().split()))
    d = a[0] - n

    for i in range(1, n):
        if (a[i] + n + d) % n != i:
            print("NO")
            break
        d = -d
    else:
        print("YES")


# t = int(input())
t = 1
for num in range(t):
    # print("Case #{}: ".format(num + 1), end="")
    solve()

		     				 	   		  	 		 	 	  	