A. Circle of Students （ Codeforces Round #579 ）

There are nn students standing in a circle in some order. The index of the ii-th student is pipi. It is guaranteed that all indices of students are distinct integers from 11 to nn (i. e. they form a permutation).

Students want to start a round dance. A clockwise round dance can be started if the student 22 comes right after the student 11 in clockwise order (there are no students between them), the student 33 comes right after the student 22 in clockwise order, and so on, and the student nncomes right after the student n−1n−1 in clockwise order. A counterclockwise round dance is almost the same thing — the only difference is that the student ii should be right after the student i−1i−1 in counterclockwise order (this condition should be met for every ii from 22 to nn).

For example, if the indices of students listed in clockwise order are [2,3,4,5,1][2,3,4,5,1], then they can start a clockwise round dance. If the students have indices [3,2,1,4][3,2,1,4] in clockwise order, then they can start a counterclockwise round dance.

Your task is to determine whether it is possible to start a round dance. Note that the students cannot change their positions before starting the dance; they cannot swap or leave the circle, and no other student can enter the circle.

You have to answer qq independent queries.

Input

The first line of the input contains one integer qq (1≤q≤2001≤q≤200) — the number of queries. Then qq queries follow.

The first line of the query contains one integer nn (1≤n≤2001≤n≤200) — the number of students.

The second line of the query contains a permutation of indices p1,p2,…,pnp1,p2,…,pn (1≤pi≤n1≤pi≤n), where pipi is the index of the ii-th student (in clockwise order). It is guaranteed that all pipi are distinct integers from 11 to nn (i. e. they form a permutation).

Output

For each query, print the answer on it. If a round dance can be started with the given order of students, print "YES". Otherwise print "NO".

Example

input

Copy

5
4
1 2 3 4
3
1 3 2
5
1 2 3 5 4
1
1
5
3 2 1 5 4

output

Copy

YES
YES
NO
YES
YES

#include <bits/stdc++.h>
using namespace std;
#define rd(x) scanf("%d",&x)
#define lrd(x) scanf("%lld",&x);
#define pt(x) printf("%d\n",(x))
#define read(x) scanf("%d",&x)
#define cn cin>>
#define rep(j, k) for (int i = (int)(j); i <= (int)(k); i++)
#define ct cout<<
#define en <<endl
int a[201],b[201];
int main()
{
    int t,n,l,r;
    cin>>t;
    while(t--)
    {
        l=0,r=0;
        read(n);
        rep(1,n) read(a[i]);
        if(n==1||n==2) ct "YES" en;
        else
        {
            a[n+1]=a[1];
            rep(1,n)
            {
                if(a[i+1]>a[i]) l++;
                else r++;
            }
            if( l==n-1&&r==1 || l==1&&r==n-1 ||l==n&&r==0  || r==n&&!l  ) ct "YES" en;
            else ct "NO" en;
        }
    }
    return 0;
}

View Code