The Tape

Jaś found a very long tape at home. Without a second thought he wrote a sequence of positive integers on it. Now he wants to find, among all pairs of positions holding different values, the pair that is farthest apart.

The distance between two numbers is the difference of their positions. Two adjacent numbers are at distance $1$, two numbers separated by a single number (sharing a common neighbor) are at distance $2$, and in general the number at position $i$ and the number at position $j$ are at distance $|i - j|$.

Report the largest possible distance between two positions whose values differ.

The first line contains one integer $m$ ($1 \le m \le 10$), the number of test cases.

Each test case is given on two lines. The first line contains one integer $n$ ($1 \le n \le 10^5$), the length of the sequence written on the tape. The second line contains $n$ integers $a_i$ ($1 \le a_i \le 10^9$) separated by single spaces.

Print $m$ lines, one per test case.

If the sequence of the $i$-th test case contains no pair of differing values, the $i$-th line must contain the single word BRAK. Otherwise the $i$-th line must contain one integer: the distance between the farthest pair of positions whose values differ.

In the first sample, one farthest pair of differing values is the first number ($2$) and the seventh number ($5$), which are at distance $6$.