#include<cstdio>
#include<algorithm>
using namespace std;
#define MAXN 1000
typedef long long LL;
int n,c[MAXN+10],l[MAXN+10],r[MAXN+10],T,a[MAXN+10];
long long mod[MAXN+10],b[MAXN+10];
template<class T>
void Read(T &x){
    char c;
    while(c=getchar(),c!=EOF)
        if(c>='0'&&c<='9'){
            x=c-'0';
            while(c=getchar(),c>='0'&&c<='9')
                x=x*10+c-'0';
            ungetc(c,stdin);
            return;
        }
}

void read(){
    Read(n);
    int i,now=0;
    for(i=1;i<=n;i++){
        Read(b[i]);
        a[b[i]]=i;
    }
    for(int j=2;j<=n;j++)
        l[j]=j-1;
    l[1]=n;
    for(int j=1;j<n;j++)
        r[j]=j+1;
    r[n]=r[0]=1;
    for(i=1;i<=n;i++){
        mod[i-1]=n-i+1;
        int cnt=0;
        while(now!=a[i])
            now=r[now],cnt++;
        b[i-1]=cnt;
        l[r[now]]=l[now];
        r[l[now]]=r[now];
    }
}
void exgcd(LL a,LL b,LL &d,LL &x,LL &y)
{
    if(!b)d=a, x=1, y=0;
    else
    {
        exgcd(b,a%b,d,y,x);
        y-=a/b*x;
    }
}

void CRT2(LL b[],LL n[],int num)
{
    bool flag=0;
    LL n1=n[0], n2, b1=b[0], b2, bb, d, t, k, x, y;
    for(int i=1;i<num;++i)
    {
        n2=n[i], b2=b[i], bb=b2-b1;
        exgcd(n1,n2,d,x,y);
        if(bb%d){flag=1;break;}
        k=bb/d*x, t=n2/d;
        if(t<0)t=-t;
        k=(k%t+t)%t;
        b1+=n1*k, n1=n1/d*n2;
    }
    b1%=n1;
    if(flag){puts("Creation August is a SB!");return;}
    else if(b1==0)b1=n1;
    printf("%I64d\n",b1);
}

int main()
{
    Read(T);
    while(T--){
        read();
        CRT2(b,mod,n);
    }
}