#include<bits/stdc++.h> using namespace std; typedef long long ll; ll a[200010],n,ans1=0,ans2=0; void FindAns(){ for(ll i=1;i<=n;i++){ if(a[i]==a[n-i+1]){ continue; } ans1=a[i],ans2=a[n-i+1]; return; } } bool check(int ans){ int l=1,r=n; while(l<=r){ if(a[l]==a[r]){ l++;r--; }else if(a[l]!=a[r]){ if(a[l]==ans){ l++; }else if(a[r]==ans){ r--; }else{ return 0; } } } return 1; } int main(){ ll t; cin>>t; while(t--){ ans1=ans2=0; cin>>n; for(ll i=1;i<=n;i++){ cin>>a[i]; } FindAns(); if(check(ans1)&&check(ans2)){ cout<<2<<endl; cout<<ans1<<" "<<ans2<<endl; }else if(check(ans1)){ cout<<1<<endl; cout<<ans1<<endl; }else if(check(ans2)){ cout<<1<<endl; cout<<ans2<<endl; }else{ cout<<0<<endl<<endl; } } return 0; }