Problem: You found a useless array a of 2n positive integers. You have realized that you actually don't need this array, so you decided to throw out all elements of a.

It could have been an easy task, but it turned out that you should follow some rules: 

  1. In the beginning, you select any positive integer x.
  2. Then you do the following operation n times: 
    * select two elements of array with sum equals x; 
    * remove them from a and replace x with maximum of that two numbers. 



For example, if initially a = [3, 5, 1, 2], you can select x = 6. Then you can select the second and the third elements of a with sum 5 + 1 = 6 and throw them out. After this operation, x equals 5 and there are two elements in array: 3 and 2. You can throw them out on the next operation.

Note, that you choose x before the start and can't change it as you want between the operations.

Determine how should you behave to throw out all elements of a.

Input

The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases.

The first line of each test case contains the single integer n (1 ≤ n ≤ 1000).

The second line of each test case contains 2n integers a_1, a_2, ..., a_{2n} (1 ≤ a_i ≤ 10^6) — the initial array a.

It is guaranteed that the total sum of n over all test cases doesn't exceed 1000.

Output

For each test case in the first line print YES if it is possible to throw out all elements of the array and NO otherwise.

If it is possible to throw out all elements, print the initial value of x you've chosen. Print description of n operations next. For each operation, print the pair of integers you remove.

Example

Input


4
2
3 5 1 2
3
1 1 8 8 64 64
2
1 1 2 4
5
1 2 3 4 5 6 7 14 3 11


Output


YES
6
1 5
2 3
NO
NO
YES
21
14 7
3 11
5 6
2 4
3 1

Note

The first test case was described in the statement.

In the second and third test cases, we can show that it is impossible to throw out all elements of array a.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;

public class Main implements Runnable {
    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;
        private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new InputMismatchException();

            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }

                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

        public int nextInt() {
            int c = read();

            while (isSpaceChar(c))
                c = read();

            int sgn = 1;

            if (c == '-') {
                sgn = -1;
                c = read();
            }

            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));

            return res * sgn;
        }

        public long nextLong() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;

            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public double nextDouble() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            double res = 0;
            while (!isSpaceChar(c) && c != '.') {
                if (c == 'e' || c == 'E')
                    return res * Math.pow(10, nextInt());
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            if (c == '.') {
                c = read();
                double m = 1;
                while (!isSpaceChar(c)) {
                    if (c == 'e' || c == 'E')
                        return res * Math.pow(10, nextInt());
                    if (c < '0' || c > '9')
                        throw new InputMismatchException();
                    m /= 10;
                    res += (c - '0') * m;
                    c = read();
                }
            }
            return res * sgn;
        }

        public String readString() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));

            return res.toString();
        }

        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public String next() {
            return readString();
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }

    public static void main(String args[]) throws Exception {
        new Thread(null, new Main(), "Main", 1 << 27).start();
    }

    static class Pair {
        int f;
        int s;
        int p;
        PrintWriter w;

        // int t;

        Pair(int f, int s) {
            // Pair(int f,int s, PrintWriter w){
            this.f = f;
            this.s = s;
            // this.p = p;
            // this.w = w;
            // this.t = t;

        }

        public static Comparator<Pair> wc = new Comparator<Pair>() {
            public int compare(Pair e1, Pair e2) {

                // 1 for swap
                if (Math.abs(e1.f) - Math.abs(e2.f) != 0) {
                    // e1.w.println("**"+e1.f+" "+e2.f);
                    return -1 * (Math.abs(e1.f) - Math.abs(e2.f));
                } else {
                    // e1.w.println("##"+e1.f+" "+e2.f);
                    return (Math.abs(e1.s) - Math.abs(e2.s));
                }

            }
        };
    }

    public static long gcd(long a, long b) {
        if (b == 0)
            return a;
        else
            return gcd(b, a % b);
    }

    //// recursive BFS
    public static int bfsr(int s, ArrayList<Integer>[] a, boolean[] b, int[] pre) {
        b[s] = true;
        int p = 1;
        int n = pre.length - 1;
        int t = a[s].size();
        int max = 1;
        for (int i = 0; i < t; i++) {
            int x = a[s].get(i);
            if (!b[x]) {
                // dist[x] = dist[s] + 1;
                int xz = (bfsr(x, a, b, pre));
                p += xz;
                max = Math.max(xz, max);
            }
        }
        // max = Math.max(max,(n-p));
        pre[s] = max;
        return p;
    }

    //// iterative BFS
    public static int bfs(int s, ArrayList<Integer>[] a, int dist, boolean[] b, PrintWriter w) {
        b[s] = true;
        int siz = 0;
        dist--;
        Queue<Integer> q = new LinkedList<>();
        q.add(s);
        while (q.size() != 0 && dist > 0) {
            int i = q.poll();
            Iterator<Integer> it = a[i].listIterator();
            int z = 0;
            while (it.hasNext() && dist > 0) {
                z = it.next();
                if (!b[z]) {
                    b[z] = true;
                    dist--;
                    // dist[z] = dist[i] + 1;
                    siz++;
                    q.add(z);
                }
            }

        }
        return siz;
    }

    public static int lower(int key, int[] a) {
        int l = 0;
        int r = a.length - 1;
        int res = 0;

        while (l <= r) {
            int mid = (l + r) / 2;

            if (a[mid] <= key) {
                l = mid + 1;
                res = mid + 1;
            } else {
                r = mid - 1;
            }
        }

        return res;
    }

    public static long power(long x, long y, long m) {
        if (y == 0)
            return 1;

        long p = power(x, y / 2, m) % m;
        p = (p * p) % m;

        if (y % 2 == 0)
            return p;
        else
            return (x * p) % m;
    }

    //////////////////////////////////////////////////////////////////////////////////////////////////////
    //////////////////////////////////////////////////////////////////////////////////////////////////////

    public void run() {
        // code here
        InputReader sc = new InputReader(System.in);
        PrintWriter w = new PrintWriter(System.out);
        int defaultValue = 0;
        // int i, j, flag;
        // // int N = 10000;
        // ArrayList<Integer> p = new ArrayList<Integer>();
        // // int c = 0;
        // for (i = 1; i < 50000; i++) {

        // if (i == 1 || i == 0)
        // continue;

        // flag = 1;

        // for (j = 2; j <= i / 2; ++j) {
        // if (i % j == 0) {
        // flag = 0;
        // break;
        // }
        // }
        // if (flag == 1) {
        // p.add(i);
        // // c++;
        // }
        // }

        int t = sc.nextInt();
        while (t-- > 0) {
            int n = sc.nextInt() * 2;
            ArrayList<Integer> a = new ArrayList<Integer>();
            HashMap<Integer, Integer> hm = new HashMap<Integer, Integer>();
            HashMap<Integer, Integer> hm2 = new HashMap<Integer, Integer>();
            for (int i = 0; i < n; i++) {
                int x = sc.nextInt();
                int y = hm.getOrDefault(x, defaultValue);
                if (y == 0) {
                    a.add(x);
                }
                hm.put(x, y + 1);
                hm2.put(x, y + 1);

            }
            Collections.sort(a);

            n--;
            int ans = -1;
            boolean f = true;

            for (int k = a.size() - 1; k > -1; k--) {
                int x = a.get(a.size() - 1);
                int y = hm.getOrDefault(x, defaultValue);
                if (y <= 0)
                    continue;
                hm.put(x, y - 1);
                f = true;
                int kk = a.get(k);
                hm.put(kk, hm.getOrDefault(kk, defaultValue) - 1);
                int j = a.size() - 2;
                for (int i = a.size() - 1; i > -1; i--) {
                    y = hm.getOrDefault(x, defaultValue);
                    if (y != 0) {
                        f = false;
                        break;
                    }

                    int xn = -1;
                    for (; j > -1 && hm.getOrDefault(a.get(j), defaultValue) == 0; j--) {

                    }
                    if (j > -1) {
                        xn = a.get(j);
                        j--;
                    } else {

                        break;
                    }
                    int yn = hm.getOrDefault(x - xn, defaultValue);
                    if (yn <= 0) {
                        f = false;
                        break;
                    } else {

                        hm.put(xn, hm.getOrDefault(xn, defaultValue) - 1);
                        hm.put(x - xn, hm.getOrDefault(x - xn, defaultValue) - 1);
                        n -= 2;
                        x = xn;
                    }
                }

                hm.put(kk, hm.getOrDefault(kk, defaultValue) + 1);
                if (f) {

                    ans = k;
                    break;
                }
                hm.clear();
                hm.putAll(hm2);
            }
            hm.clear();
            hm.putAll(hm2);
            if (f && ans != -1) {

                w.println("YES");
                int x = a.get(a.size() - 1);
                int y = hm.getOrDefault(x, defaultValue);
                hm.put(x, y - 1);

                int kk = a.get(ans);
                w.println(x + kk);
                w.println(x + " " + kk);
                hm.put(kk, hm.getOrDefault(kk, defaultValue) - 1);
                int j = a.size() - 2;
                for (int i = a.size() - 1; i > -1; i--) {
                    y = hm.getOrDefault(x, defaultValue);

                    if (y != 0) {
                        f = false;
                        // w.println("***" + y);
                        break;
                    }

                    int xn = -1;
                    for (; j > -1 && hm.getOrDefault(a.get(j), defaultValue) == 0; j--) {
                        /// w.println("#" + a.get(j));
                    }
                    if (j > -1) {
                        xn = a.get(j);
                        j--;
                    } else {
                        // w.println("*");
                        break;
                    }
                    if (xn == -1) {
                        // w.println("**");
                        break;
                    }
                    int yn = hm.getOrDefault(x - xn, defaultValue);
                    if (yn <= 0) {
                        f = false;
                        // w.println("****");
                        break;
                    } else {

                        hm.put(xn, hm.getOrDefault(xn, defaultValue) - 1);
                        hm.put(x - xn, hm.getOrDefault(x - xn, defaultValue) - 1);
                        w.println(xn + " " + (x - xn));
                        n -= 2;
                        x = xn;
                    }
                }
            } else {
                w.println("NO");
            }

        }

        w.flush();
        w.close();

    }

}