Statement:
You have an array containing of n elements and you need to find two indices i and j such that they sum up to n.

Input:
: The first line contains the integer t which is the number of testcases.
: The second line of t testcases contains an integer n which is the length of the array.
: The third line of t testcases contains the array of length n.

Output:
For each testcase t, print "YES" and i j if it is possible else only "NO".

Constraints:
Every Variable: 1<=[variable] <= 1000.

Sample I/O:
Input:
4
3
1 3 2
5
6 3 2 1 8
1
2
4
3 5 2 6

Output:
YES
1 2
YES
3 2
NO
NO