Given a permutation P of 1 to N, YY wants to know whether there exists such three elements P[i
1], P[i
2], P[i
3] that
P[i
1]-P[i
2]=P[i
2]-P[i
3], 1<=i
1<i
2<i
3<=N.
The first line is T(T<=60), representing the total test cases.
Each test case comes two lines, the former one is N, 3<=N<=10000, the latter is a permutation of 1 to N.
For each test case, just output 'Y' if such i
1, i
2, i
3 can be found, else 'N'.