1 #include <stdio.h>
 2 #include <string.h>
 3 #include <algorithm>
 4 using namespace std;
 5 
 6 int n,a[205],b[205],dp[205];
 7 
 8 int LICS()
 9 {
10     int MAX,i,j,k;
11     memset(dp,0,sizeof(dp));
12     MAX = 0;
13     for(i = 1; i<=n; i++)
14     {
15         k = 0;
16         for(j = 1; j<=n-i+1; j++)
17         {
18             if(a[i] == b[j])
19             {
20                 if(j!=(n-i+1))//没与自身匹配
21                 {
22                     if(dp[j]<(dp[k]+2))//长度加2
23                         dp[j] = dp[k]+2;
24                 }
25                 else//与自身匹配了
26                 {
27                     if(dp[j]<(dp[k]+1))//自身所以只加1长度
28                         dp[j] = dp[k]+1;
29                 }
30             }
31             else if(a[i]>b[j] && dp[k]<dp[j])
32                 k = j;
33             if(MAX<dp[j])
34                 MAX = dp[j];
35         }
36     }
37 
38     return MAX;
39 }
40 
41 int main()
42 {
43     int t,i;
44     scanf("%d",&t);
45     while(t--)
46     {
47         scanf("%d",&n);
48         for(i = 1; i<=n; i++)
49             scanf("%d",&a[i]);
50         for(i = 1; i<=n; i++)
51             b[i] = a[n-i+1];
52         printf("%d\n",LICS());
53     }
54 
55     return 0;
56 }