Given the pseudo-code of a function Build−Tree(A,id,L,R):

where A is given in input, id is the number of node, L ,R is the left position and the right position of A

Require the number of nodes created by Build−Tree(A,root,1,n).

The first line contains an integer $T$ ($1 \le T \le 5$) representing the number of test cases.

For each test case, the first contain one integer $n$($1\le n\le 2\times10^5$).

The second line contain n integers $A_i$($1\le A_i\le10^9$).

For each test output one line, the number of nodes created by Build−Tree(A,root,1,n).

来源：2021“MINIEYE杯”中国大学生算法设计超级联赛（5）1006