#include <bits/stdc++.h>

using namespace std;
#define eb emplace_back
#define mp make_pair
#define FF first
#define SS second
#define fori(n) for(int i = 0;i<(int)n;i++)
#define forj(n) for(int j = 0;j<(int)n;j++)
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define whats(x) cerr << #x << " is " << x << endl
#define FAST_IO ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll, ll> ii;
const ll inf = 1e11, MAX = 1e5 + 10, mud = 1e9 + 7;

int main() {
    FAST_IO
    ll t = 1;
    cin >> t;
    while (t--) {
        ll n;
        cin >> n;
        vi a(n);
        set<ll> s;
        fori(n) {
            cin >> a[i];
            s.insert(a[i]);
        }
        bool can = 1;
        fori(a.size()) {
            if (a.size() > 300) {
                can = 0;
                break;
            }
            forj(a.size()) {
                if (a.size() > 300) {
                    can = 0;
                    break;
                }
                if (i == j)continue;
                ll delta = abs(a[i] - a[j]);
                if (s.count(delta) == 0) {
                    a.push_back(delta);
                    s.insert(delta);
                }
            }
        }
        if (can) {
            cout << "YES\n";
            cout << a.size() << endl;
            fori(a.size()) {
                cout << a[i] << " ";
            }
            cout << endl;
        } else
            cout << "NO" << endl;
    }
    return 0;

}

