Case of Fake Numbers

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.

Input

The first line contains integer n (1 ≤ n ≤ 1000) — the number of gears.

The second line contains n digits a1, a2, ..., an (0 ≤ ai ≤ n - 1) — the sequence of active teeth: the active tooth of the i-th gear contains number ai.

Output

In a single line print "Yes" (without the quotes), if the given Stolp's gears puzzle is real, and "No" (without the quotes) otherwise.

Sample 1

Inputcopy	Outputcopy
3 1 0 0	Yes

Sample 2

Inputcopy	Outputcopy
5 4 2 1 4 3	Yes

Sample 3

Inputcopy	Outputcopy
4 0 2 3 1	No

Note

In the first sample test when you push the button for the first time, the sequence of active teeth will be 2 2 1, when you push it for the second time, you get 0 1 2.

题意：

有n个齿轮，每个齿轮有n个齿编号0~n-1按逆时针排列，每个齿轮都有一个针指向一个齿并且不随齿轮转动；有一个按钮，每按一次就会让第奇数个齿轮顺时针转动一齿，第偶数个齿轮逆时针转动一齿；给你一组针的初始指向编号值，问按任意次按钮，能否使这n个齿轮上的针指向的齿的编号为0,1,2,3...,n-1。

思路：

让第一个齿轮的针指向0，看后面齿轮的针指向的编号是否满足1,2,3~,n-1。

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<string>
#include<cmath>
#include<map>
using namespace std;
typedef long long ll;
void slove()
{
    int n;
    cin>>n;
    int f;
    cin>>f;
    int flag=1;
    for(int i=1;i<n;i++)
    {
        int k;
        cin>>k;
        if(i%2)
        {
            if((k+f)%n!=i)
            {
                flag=0;
                break;
            }
        }
        else
        {
            if((k-f+n)%n!=i)
            {
                flag=0;
                break;
            }
        }
    }
    if(flag)
        cout<<"Yes"<<endl;
    else
        cout<<"No"<<endl;
}
int main()
{
    slove();
}