#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pii;
#define bug puts("===========");
const double pi=(acos(-1.0));
const double eps=1e-8;
const ll INF=1e18+10;
const ll inf=1e14;
const int maxn=200+10;
//const int mod=100000007;
/*===============================*/
ll a[maxn], m[maxn], n;
ll extend_gcd(ll a, ll b, ll &x, ll &y) {
    if (b == 0) {
        x = 1, y = 0;
        return a;
    }
    else {
        ll r = extend_gcd(b, a % b, y, x);
        y -= x * (a / b);
        return r;
    }
}
ll CRT(ll a[], ll m[], int n) {
    if (n == 1) {
        if (m[0] > a[0]) return a[0];
        else return -1;
    }
    ll x, y, d;
    for (int i = 1; i < n; i++) {
        if (m[i] <= a[i]) return -1;
        d = extend_gcd(m[0], m[i], x, y);
        if ((a[i] - a[0]) % d != 0) return -1;
        ll t = m[i] / d;
        x = ((a[i] - a[0]) / d * x % t + t) % t;
        a[0] = x * m[0] + a[0];
        m[0] = m[0] * m[i] / d;
        a[0] = (a[0] % m[0] + m[0]) % m[0];
    }
    return a[0];
}
int b[maxn];
int visit[maxn];
int main()
{
    int T_T;
    scanf("%d",&T_T);
    while(T_T--){
        int n;
        scanf("%d",&n);
        for(int i=0;i<n;i++) {
            int rd;
            scanf("%d",&rd);
            //b[i+1]=rd;
            b[rd]=i+1;
        }
        mem(visit,0);
        ll z=1;
        for(int i=1;i<=n;i++){
            int cnt=0;
            for(int j=b[i-1]+1;;j++){
                if(j==n+1) j=1;
                if(visit[j]==0) cnt++;
                if(j==b[i]) {
                    visit[j]=1;
                    break;
                }
            }
            a[i-1]=cnt;
            m[i-1]=n-i+1;
            a[i-1]%=m[i-1];
            z=z*m[i-1]/__gcd(z,m[i-1]);
        }
        ll ans=CRT(a,m,n);
        if(ans==0){ans+=z;}
        if(ans==-1)  puts("Creation August is a SB!");
        else        printf("%I64d\n",ans);
    }

}