#include <bits/stdc++.h>
#include<string>
//#include<unordered_set>
     #define ll long long int
    #define fi first
    #define se second
    #define m_p make_pair
    #define endl '\n'
    #define fast_io ios_base::sync_with_stdio(0); cin.tie(0)
    #define endl '\n'
    #define loop(i, a, b) for (long long unsigned int i = a; i < b; i++)
    #define pb push_back
    #define all(v) v.begin(),v.end()
    using namespace std;

   // typedef long long ll;
     typedef pair<ll,ll> pairs;
    const int MAXN = 412345;
    const int MAXINT = 2047483098;
    const ll MOD = 1e9 + 7;
    const int MAX = 1e4;
     const long double pi=2*acosl(0);
    const long double EPS = 1e-10;
     int gcd(int a,int b){if(b==0)return a;return gcd(b,a%b);}

bool isPrime(long long unsigned n){if(n<=1)return false;if(n<=3)return true;
	if(n%2==0||n%3==0)return false;for(int i=5;i*i<=n;i=i+6)
	if(n%i==0||n%(i+2)==0)return false;return true;}

int nCr(int n,int r){int res=1;if(n<r)return -1;r=min(r,n-r);
	loop(i,0,r){res*=(n-i);res/=(i+1);}return res;}

int nPr(int n,int r){int res=1;if(n<r)return -1;
	loop(i,0,r)res*=(n-i);return res;}
   bool comp(ll &a,ll &b){
       return a>b;
   }
void solve(){
 ll n;
 cin>>n;
 vector<ll> vec(n);
 map<ll,bool> mp;
 loop(i,0,n){
     cin>>vec[i];
     mp[vec[i]]=true;
 }
ll s=n;
for(ll i=0;i<vec.size();i++){
   for(ll j=0;j<vec.size();j++){
       if(j==i)continue;
       ll a=abs(vec[i]-vec[j]);
       if(!mp[a]){
        s++;
        vec.pb(a);
        mp[a]=true;
       }
       if(s>300){
           cout<<"NO";
           return;
       }
   }
}
  if(s>300){
           cout<<"NO";
           return;
       }else{
           cout<<"YES"<<endl;
           cout<<vec.size()<<endl;
           loop(i,0,vec.size()){
               cout<<vec[i]<<" ";
           }
       }

}
        


    int main()
    {
        fast_io;

        int T=1 ;
      cin >> T;
      
        while(T--) {
            solve();
            cout<<endl;
        }

        return 0;
}



