#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define mp map<ll, ll>
#define um unordered_map<ll, ll>
#define pll pair<ll, ll>
#define st set<ll> 
#define us unordered_set<ll>
#define vt vector<ll>
#define vp vector<pll>
#define fl(i, x, y) for(long i=x;i<y;++i)
#define flr(i, x, y) for(long i=x;i>=y;--i)
#define Posinf INT_MAX
#define Neginf INT_MIN


int main()
{
  ios_base::sync_with_stdio(false);
    cin.tie(NULL);

// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif // ONLINE_JUDGE

       ll i,j,k,l,e,n,m,t;  

        cin>>t;
       for(ll tc=1;tc<=t;tc++)
       {
          cin>>n;
          ll arr[n];
          ll flg=0;
          for(i=0;i<n;i++)
          {
            cin>>arr[i];
            if(arr[i]<0)
              flg=1;
          }  
          if(flg==1)
          {
            cout<<"no \n";
            continue;
          }
          ll mx=*max_element(arr,arr+n);

          cout<<"yes \n";
          cout<<mx+1<<endl;
          for(i=0;i<=mx;i++)
            cout<<i<<" ";
          cout<<endl;

       }

return 0; 
}



