#include <bits/stdc++.h>
using namespace std;
int m,n,ciag,ciag1,b,g;
int t[100001],k[11];
int main ()
{
    ios_base::sync_with_stdio(0);
    cin >> m;
    for ( int j = 1; j <= m;j++)
    {
        cin >> n;
        for ( int p = 1; p <= n; p++)
        {
            cin >> t[p];
        }
        for ( int i = 1; i <= n; i++ )
        {
           if ( t[1] != t[i] ) ciag = i - 1;
        }
        for ( int l = n; l > 0; l--)
        {
            if ( t[n] != t[l] ) ciag1 = n - l - 1;
        }
        k[j] = max(ciag,ciag1);
        }
    for ( int i = 1; i <= m; i++)
    {
        if ( k[i] == 0) cout << "BRAK" << endl;
        else cout << k[i] << endl;
    }
}