You are given an array of N elements.
You have to find the length of longest strictly increasing subsequence present in array.
e.g if array is [1,3,2,4 ]
increasing sequences are : {1}, {3}, {2}, {4}, {1,3},{1,2},{1,4},{3,4},{2,4},{1,3,4},{1,2,4}
hence longest increasing sequences are {1,3,4},{1,2,4}
because length = 3

Input :
First line will contain an integer 'T' (number of test cases ).
For each test case there is an integer 'N' (number of elements in array).
On next line there will be N integers (array elements).

output :
for each test case print the required output

constraint :
1<=T<=20
1<=N<=20
1<=a[i]<=1000000000