//
// Created by lyuba on 26.08.2019.
//
#include <iostream>
using namespace std;

int main(){
    int q, n;
    int ind_min;
    bool flag;
    int arr[201];
    cin >> q;
    for (int i = 0; i < q; i++) {
        cin >> n;
        for (int j = 0; j < n; j++) {
            cin >> arr[j];
        }
        if (n == 1){
            cout << "YES";
            continue;
        }
        ind_min = 0;
        for (int j = 1; j < n; j++){
            if (arr[j] < arr[ind_min])
                ind_min = j;
        }
        flag = false;
        int j = ind_min + 1;
        while((j % n) != ind_min ){
            if (arr[(j) % n] == arr[(j - 1) % n] + 1)
                j++;
            else
                break;
        }
        if ((j % n) == ind_min){
            cout << "YES\n";
            continue;
        }
        if(ind_min == 0)
            j = n - 1;
        else
            j = ind_min - 1;
        while((j % n) != ind_min){
            if (arr[(j) % n] == arr[(j + 1) % n] + 1)
                if (j - 1 < 0)
                    j = n - 1;
                else
                    j--;
            else
                break;
        }
        if ((j % n) == ind_min){
            cout << "YES\n";
        } else
            cout << "NO\n";
    }
    return 0;
}