#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;

int main(){
  ll t;
  cin>>t;
  while(t--){
    ll n;
    cin>>n;
    vector<ll> a(n);
    for(ll i=0;i<n;i++){
      cin>>a[i];
    }
    vector<vector<ll>> G(n);
    vector<ll> in(n,0);
    for(ll i=0;i<n;i++){
      vector<P> v;
      for(ll j=-1;j<=1;j++){
        v.push_back(P(a[(i+j+n)%n],(i+j+n)%n));
      }
      sort(v.begin(),v.end());
      for(ll j=0;j<2;j++){
        G[v[j].second].push_back(v[j+1].second);
        in[v[j+1].second]++;
      }
      if(v[1].first==v[2].first){
        G[v[2].second].push_back(v[1].second);
        in[v[1].second]++;
      }
    }
    for(ll i=0;i<n;i++){
      if(G[i].size()>=2){
        sort(G[i].begin(),G[i].end());
        G[i].erase(unique(G[i].begin(),G[i].end()));
      }
    }
    queue<ll> que;
    vector<bool> seen(n,false);
    for(ll i=0;i<n;i++){
      if(in[i]==0){
        que.push(i);
        seen[i]=true;
        break;
      }
    }
    while(que.size()){
      ll q=que.front();
      que.pop();
      for(ll u:G[q]){
        if(!seen[u]){
          seen[u]=true;
          que.push(u);
        }
      }
    }
    bool ok=true;
    for(ll i=0;i<n;i++){
      if(!seen[i]){
        ok=false;
        break;
      }
    }
    if(ok){
      cout<<"Yes"<<endl;
    }else{
      cout<<"No"<<endl;
    }
  }
}