#include <iostream>
using namespace std;
int max(int a, int b){
if (a > b) return a;
return b;
}
bool max_distance(int n, int t[]){
int distance = 0;
int backdistance = 0;
for (int i = 0; i < n; i++) {
if (t[i] != t[n - 1]) {
distance = n - 1 - i;
break;
}
}
for (int i = n-1; i >= 0; i--) {
if (t[i] != t[0]) {
backdistance = n - 1 - i;
break;
}
}
int j = 0;
for (int i = n-1; i >= 0; i--) {
if (t[i] == t[0]){
j++;
}
}
if (j == n-1) return "BRAK";
return max(distance,backdistance);
}
int main() {
int m;
cin >> m;
for (int i = 0; i < m; i++){
int n;
cin >> n;
int t [n];
for (int j = 0; j < n; j++){
cin >> t[j];
}
cout << max_distance(n, t) << endl;
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1heChpbnQgYSwgaW50IGIpewoJaWYgKGEgPiBiKSByZXR1cm4gYTsKCXJldHVybiBiOwp9Cgpib29sIG1heF9kaXN0YW5jZShpbnQgbiwgaW50IHRbXSl7CglpbnQgZGlzdGFuY2UgPSAwOwoJaW50IGJhY2tkaXN0YW5jZSA9IDA7Cglmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewogICAgICAgIGlmICh0W2ldICE9IHRbbiAtIDFdKSB7CiAgICAgICAgICAgIGRpc3RhbmNlID0gbiAtIDEgLSBpOwogICAgICAgICAgICBicmVhazsKICAgICAgICB9Cgl9Cglmb3IgKGludCBpID0gbi0xOyBpID49IDA7IGktLSkgewogICAgICAgIGlmICh0W2ldICE9IHRbMF0pIHsKICAgICAgICAgICAgYmFja2Rpc3RhbmNlID0gbiAtIDEgLSBpOwogICAgICAgICAgICBicmVhazsKICAgICAgICB9Cgl9CglpbnQgaiA9IDA7Cglmb3IgKGludCBpID0gbi0xOyBpID49IDA7IGktLSkgewogICAgICAgIGlmICh0W2ldID09IHRbMF0pewogICAgICAgIAlqKys7CiAgICAgICAgfQoJfQoJaWYgKGogPT0gbi0xKSByZXR1cm4gIkJSQUsiOwoJcmV0dXJuIG1heChkaXN0YW5jZSxiYWNrZGlzdGFuY2UpOwp9CgppbnQgbWFpbigpIHsKCWludCBtOwoJY2luID4+IG07Cglmb3IgKGludCBpID0gMDsgaSA8IG07IGkrKyl7CgkJaW50IG47CgkJY2luID4+IG47CgkJaW50IHQgW25dOwoJCWZvciAoaW50IGogPSAwOyBqIDwgbjsgaisrKXsKCQkJY2luID4+IHRbal07CgkJfQoJCWNvdXQgPDwgbWF4X2Rpc3RhbmNlKG4sIHQpIDw8IGVuZGw7Cgl9CglyZXR1cm4gMDsKfQ==