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:
//package credit;


import com.sun.jdi.request.InvalidRequestStateException;
import com.sun.security.jgss.GSSUtil;

import javax.swing.*;
import javax.swing.text.MutableAttributeSet;
import java.io.*;
import java.net.Inet4Address;
import java.text.CollationElementIterator;
import java.util.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.function.DoublePredicate;

public class sas {
    static boolean v[];
    static int ans[];
    int size[];
    static int count=0;
    static int dsu=0;
    static int c=0;
    int min=Integer.MAX_VALUE;
    int max1=Integer.MIN_VALUE;
    long max=Long.MIN_VALUE;
    boolean aBoolean=true;
    boolean y=false;
        static class FastReader
        {
            BufferedReader br;
            StringTokenizer st;

            public FastReader()
            {
                br = new BufferedReader(new
                        InputStreamReader(System.in));
            }

            String next()
            {
                while (st == null || !st.hasMoreElements())
                {
                    try
                    {
                        st = new StringTokenizer(br.readLine());
                    }
                    catch (IOException  e)
                    {
                        e.printStackTrace();
                    }
                }
                return st.nextToken();
            }

            int nextInt()
            {
                return Integer.parseInt(next());
            }

            long nextLong()
            {
                return Long.parseLong(next());
            }

            double nextDouble()
            {
                return Double.parseDouble(next());
            }

            String nextLine()
            {
                String str = "";
                try
                {
                    str = br.readLine();
                }
                catch (IOException e)
                {
                    e.printStackTrace();
                }
                return str;
            }
        }
        int parent[];
        int rank[];
        ArrayList<ArrayList<Integer>> arrayLists;
        boolean v1[];
        boolean t1=false;
        boolean r=false;
        int fib[];
        int fib1[];
        public static void main(String[] args) throws IOException {
            sas g = new sas();
            g.go();
        }
        public void go() throws IOException {
            FastReader scanner=new FastReader();
//            Scanner scanner=new Scanner(System.in);
            PrintWriter printWriter = new PrintWriter(System.out);
            int t =scanner.nextInt();
            for (int i = 0; i < t; i++) {
                int n=scanner.nextInt()*2;
                int arr[]=new int[n];
                boolean t1=true;
                HashMap<Integer,Integer> hashMap=new HashMap<Integer,Integer>();
                for (int j = 0; j < n; j++) {
                    int r=scanner.nextInt();
                    arr[j]=r;
                    hashMap.put(arr[j],hashMap.getOrDefault(arr[j],0)+1);
                }
                ArrayList<Integer> arrayList=new ArrayList<Integer>();
                sort(arr,n);
                int k=0;
                for (int j =n-2; j>=0; j--) {
                    int y=arr[n-1];
                    t1=true;
                    hashMap.put(arr[j],hashMap.get(arr[j])-1);
                    arrayList.add(arr[j]);
                    HashMap<Integer,Integer> hashMap1=new HashMap<Integer, Integer>();
                    for (k =n-2; k>=0; k--){
                        if(k==j){
                            continue;
                        }
                        else if(hashMap1.getOrDefault(arr[k],0)>0){
                            hashMap1.put(arr[k],hashMap1.getOrDefault(arr[k],0)-1);
                            continue;
                        }
                        else {
                            if (arr[k] != y - arr[k] && hashMap.getOrDefault(arr[k], 0) > 0 && hashMap.getOrDefault(y - arr[k], 0) > 0 || arr[k] == (y - arr[k]) && hashMap.getOrDefault(y - arr[k], 0) > 1) {
                                hashMap.put(y - arr[k], hashMap.get(y - arr[k]) - 1);
                                hashMap.put(arr[k], hashMap.getOrDefault(arr[k], 0) - 1);
                                hashMap1.put(y - arr[k], hashMap1.getOrDefault(y - arr[k], 0) + 1);
                                hashMap1.put(arr[k], hashMap1.getOrDefault(arr[k], 0) + 1);
                                arrayList.add(y - arr[k]);
                                arrayList.add(arr[k]);
                                y = arr[k];
                            } else {
                                t1 = false;
                                break;
                            }
                        }
                    }
                    for(int h:arrayList){
                        hashMap.put(h,hashMap.getOrDefault(h,0)+1);
                    }
                    if(k==-1){
                        break;
                    }
                    arrayList=new ArrayList<Integer>();
                }
                if(arrayList.size()!=0){
                    printWriter.println("YES");
                    printWriter.println(arr[n-1]+arrayList.get(0));
                    printWriter.println(arr[n-1]+" "+arrayList.get(0));
                    for (int j = 1; j < arrayList.size(); j+=2) {
                        printWriter.println(arrayList.get(j+1)+" "+arrayList.get(j));
                    }
                }else{
                    printWriter.println("NO");
                }
            }
            printWriter.flush();
        }
        public void fib(int y,int z){

        }
        public void parent(int n){
            for (int i = 0; i < n; i++) {
                parent[i]=i;
                rank[i]=1;
                size[i]=1;
            }
        }
        public void union(int i,int j){
            int root1=find(i);
            int root2=find(j);
//            if(root1 != root2) {
//                parent[root2] = root1;
////                sz[a] += sz[b];
//            }
            if(root1==root2){
                return;
            }
            if(rank[root1]>rank[root2]){
                parent[root2]=root1;
                size[root1]+=size[root2];
            }
            else if(rank[root1]<rank[root2]){
                parent[root1]=root2;
                size[root2]+=size[root1];
            }
            else{
                parent[root2]=root1;
                rank[root1]+=1;
                size[root1]+=size[root2];
            }
        }
        public int find(int p){
           if(parent[p]!=p){
               parent[p]=find(parent[p]);
           }
           return parent[p];
//            if(parent[p]==-1){
//                return -1;
//            }
//            else if(parent[p]==p){
//                return p;
//            }
//            else {
//                parent[p]=find(parent[p]);
//                return parent[p];
//            }
        }
        public double dist(double x1,double y1,double x2,double y2){
            double e=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1);
            double e1=Math.sqrt(e);
            return e1;
        }
        public void make(int p){
            parent[p]=p;
            rank[p]=1;
        }
        Random rand = new Random();
        public void sort(int[] a, int n) {
                for (int i = 0; i < n; i++) {
                   int j = rand.nextInt(i + 1);
                   int tmp = a[i];
                   a[i] = a[j];
                   a[j] = tmp;
                }
                Arrays.sort(a, 0, n);
        }
        public long gcd(long a,long b){
               if(b==0){
                  return a;
               }
               return gcd(b,a%b);
        }
        public void dfs(ArrayList<Integer> arrayLists1){
            for (int i = 0; i < arrayLists1.size(); i++) {
                if(v1[arrayLists1.get(i)]==false){
                    System.out.println(arrayLists1.get(i));
                    v1[arrayLists1.get(i)]=true;
                    count++;
                    dfs(arrayLists.get(arrayLists1.get(i)));
                }
            }
        }
        private void dfs2(ArrayList<Integer>[]arrayList,int j,int count){
            ans[j]=count;
            for(int i:arrayList[j]){
                if(ans[i]==-1){
                    dfs2(arrayList,i,count);
                }
            }
        }
        private void dfs3(ArrayList<Integer>[] arrayList, int j) {
            v[j]=true;
            count++;
            for(int i:arrayList[j]){
                if(v[i]==false) {
                    dfs3(arrayList, i);
                }
            }
        }
        public double fact(double h){
            double sum=1;
            while(h>=1){
                sum=sum*h;
                h--;
            }
            return sum;
        }
        public long primef(double r){
            long c=0;
            while(r%2==0){
                c++;
                r=r/2;
            }
            for (int i = 3; i <=Math.sqrt(r) ;i+=2) {
                while(r%i==0){
                    c++;
                    r=r/3;
                }
            }
            if(r>2){
                c++;
            }
            return c;
        }
        public long divisor(double r){
            long c=0;
            for (int i = 1; i <=Math.sqrt(r); i++) {
                if(r%i==0){
                    if(r/i==i){
                        c++;
                    }
                    else{
                        c+=2;
                    }
                }
            }
            return c;
        }
}

class Pair{
    double x;
    double y;
    double z;
    public Pair(double x,double y){
        this.x=x;
        this.y=y;
    }
}
class Sorting implements Comparator<Pair> {
    public int compare(Pair p1,Pair p2){
        if(p1.x==p2.x){
            return -1*Double.compare(p1.y,p2.y);
        }
        else {
            return Double.compare(p1.x, p2.x);
        }
    }

}