#include<bits/stdc++.h>
using namespace std;
int t,n,a[10001];
int main(){
    freopen("sequence.in","r",stdin);
    freopen("sequence.out","w",stdout);
    cin>>t;
    while(t--){
        map<int,pair<int,int> > m;
        cin>>n;
        for(int i=1;i<=n;i++) cin>>a[i];
        bool flag=false;
        for(int i=1;i<=n;i++)
        for(int j=i+1;j<=n;j++){
            m[a[i]-a[j]].first++;
            if(m[a[i]-a[j]].first>1&&(m[a[i]-a[j]].second==a[i]||m[a[i]-a[j]].second==a[j])){
                flag=true;
                cout<<a[i]<<' '<<a[j]<<endl;
                break;
            }else m[a[i]-a[j]].second=a[j];
            if(flag) break;
        }
        if(flag) cout<<'Y'<<endl;
        else cout<<'N'<<endl;
    }
    return 0;
}