#include<bits/stdc++.h>
#include<iostream>
#include<list>

using namespace std;

#define ll              long long
#define pb              push_back
#define mp              make_pair
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define mod             1000000007
#define inf             1e18
#define w(x)            int x; cin>>x; while(x--)

void solve(){
    int n;
    cin>>n;
    int a[n];
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    sort(a,a+n);
    if(a[0]<0){
        cout<<"NO"<<endl;
    }else if(a[0]==0){
        cout<<"YES"<<endl;
        cout<<a[n-1]+1<<endl;
        for(int i=0;i<=a[n-1];i++){
            cout<<i<<" ";
        }
        cout<<endl;
    }else{
        cout<<"YES"<<endl;
        cout<<a[n-1]<<endl;
        for(int i=1;i<=a[n-1];i++){
            cout<<i<<" ";
        }
        cout<<endl;
    }
}

int main(){
    w(t){
    solve();
    }
    return 0;
}
