YY's new problem
Given a permutation P of 1 to N, YY wants to know whether there exists such three elements P[i1], P[i2], P[i3] that
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 i1, i2, i3 can be found, else 'N'.
1 3 2
3 2 4 1