#include <bits/stdc++.h>
using namespace std;
int v[200000];
int pre[200000][6];
map <int,int> f;
pair <int,int> dp[200001][2];
///first - chosen bitch, second - maxxxxxx
void solve(){
    f.clear();
    int n,i,j,l,cnt = 1,ans = 0;
    cin>>n;
    for(i = 0;i < n;i++){
        cin>>v[i];
        f[v[i]] = 1;
        for(j = 0;j < 6;j++)pre[i][j] = -1;
        dp[i][0] = dp[i][1] = {0,-1};
    }
    for(auto &i:f){
        i.second = cnt++;
    }
    for(i = 0;i < n;i++){
        v[i] = f[v[i]];
        bool ok = 0;
        if(i)for(j = 0;j < 6;j++){
            if(pre[i - 1][j] == v[i]){
                ///same
                for(l = j + 1;l < 6;l++)pre[i][l] = pre[i - 1][l];
                for(l = j;l > 0;l--){
                    pre[i][l] = pre[i - 1][l - 1];
                }
                pre[i][0] = v[i];
                ok = 1;
            }
        }
        if(!ok){
            if(i)for(j = 6;j > 0;j--){
                pre[i][j] = pre[i - 1][j - 1];
            }
            pre[i][0] = v[i];
        }
    }
    for(i = 0;i < n;i++){
        int cur = 0,cand = -1,cur2 = 0,cand2 = -1;
        if(i)for(j = 0;j < 6;j++){
            if(pre[i - 1][j] == -1 || pre[i - 1][j] == v[i])continue;
            //if(v[i] == 3)cout<<pre[i - 1][j]<<' '<<dp[pre[i - 1][j]][0].first<<' '<<dp[pre[i - 1][j]][0].second<<' '<<dp[pre[i - 1][j]][1].first<<' '<<dp[pre[i - 1][j]][1].second<<'\n';
            //if(pre[i - 1][j] == 3)cout<<pre[i - 1][j]<<' '<<dp[pre[i - 1][j]][0].first<<' '<<dp[pre[i - 1][j]][0].second<<' '<<dp[pre[i - 1][j]][1].first<<' '<<dp[pre[i - 1][j]][1].second<<'\n';
            if(dp[pre[i - 1][j]][0].first != v[i] && dp[pre[i - 1][j]][0].second >= cur){
                cur = dp[pre[i - 1][j]][0].second;
                cand = pre[i - 1][j];
            }
            if(dp[pre[i - 1][j]][1].first != v[i] && dp[pre[i - 1][j]][1].second >= cur){
                cur = dp[pre[i - 1][j]][1].second;
                cand = pre[i - 1][j];
            }
        }
        if(i)for(j = 0;j < 6;j++){
            if(pre[i - 1][j] == -1 || pre[i - 1][j] == v[i] || pre[i - 1][j] == cand)continue;
            //cout<<pre[i - 1][j]<<' ';
            if(dp[pre[i - 1][j]][0].first != v[i] && dp[pre[i - 1][j]][0].second >= cur2){
                cur2 = dp[pre[i - 1][j]][0].second;
                cand2 = pre[i - 1][j];
            }
            if(dp[pre[i - 1][j]][1].first != v[i] && dp[pre[i - 1][j]][1].second >= cur2){
                cur2 = dp[pre[i - 1][j]][1].second;
                cand2 = pre[i - 1][j];
            }
        }
        cur2++;
        cur++;
        ans = max(ans,cur);
        ans = max(ans,cur2);
        //if(v[i] == 3)cout<<cur<<' '<<cand<<' '<<cur2<<' '<<cand2<<'\n';
        ///propagation
        if(dp[v[i]][0].first == cand){
            if(dp[v[i]][0].second <= cur){
                dp[v[i]][0].second = cur;
            }
        }else if(dp[v[i]][1].first == cand){
            if(dp[v[i]][1].second <= cur){
                dp[v[i]][1].second = cur;
            }
        }else if(dp[v[i]][0].second <= cur){
            dp[v[i]][1] = dp[v[i]][0];
            dp[v[i]][0] = {cand,cur};
        }else if(dp[v[i]][1].second <= cur){
            dp[v[i]][1] = {cand,cur};
        }
        if(dp[v[i]][0].first == cand2){
            if(dp[v[i]][0].second <= cur2){
                dp[v[i]][0].second = cur2;
            }
        }else if(dp[v[i]][1].first == cand2){
            if(dp[v[i]][1].second <= cur2){
                dp[v[i]][1].second = cur2;
            }
        }else if(dp[v[i]][0].second <= cur2){
            dp[v[i]][1] = dp[v[i]][0];
            dp[v[i]][0] = {cand2,cur2};
        }else if(dp[v[i]][1].second <= cur2){
            dp[v[i]][1] = {cand2,cur2};
        }
    }
    cout<<ans<<'\n';
}
int main(){
    int t;
    cin>>t;
    while(t--)solve();
    return 0;
}