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.util.*;
import java.io.*;  
import java.util.Map.Entry;
 
public class Solution{
    public static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
        public String next() {
			while (st == null || !st.hasMoreElements())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		public int nextInt() {
			return Integer.parseInt(next());
		}
		public long nextLong() {
			return Long.parseLong(next());
		}
		public int[] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) {
				a[i]=nextInt();
			}
			return a;
		}
		public double nextDouble() {
			return Double.parseDouble(next());
		}
    }
    public static class unionFind{
        public static int[] p;
        public static int find(int u){
            while(p[u]!=u){
                u=p[u];
            }
            return u;
        }
        public static void union(int u,int v){
            int x=find(u);
            int y=find(v);
            p[x]=y;
        }
    }
    static class Point{ 
        double x; 
        double y; 
        public Point(double x, double y){ 
            this.x = x; 
            this.y = y; 
        } 
    }
    public static class SegmentTree{ 
        int st1[];
        int st2[];
        SegmentTree(int arr[], int n){ 
            int x = (int) (Math.ceil(Math.log(n) / Math.log(2))); 
            int max_size = 2 * (int) Math.pow(2, x) - 1;
            st1 = new int[max_size];
            st2 = new int[max_size];
            constructSTUtil1(arr, 0, n - 1, 0);
            constructSTUtil2(arr, 0, n - 1, 0); 
        }
        int getMid(int s, int e) { 
            return s + (e - s) / 2; 
        }
        int getSumUtil(int ss, int se, int qs, int qe, int si){
            if (qs <= ss && qe >= se){
                return st1[si]; 
            }
            if (se < qs || ss > qe) {
                return 0; 
            }
            int mid = getMid(ss, se); 
            return getSumUtil(ss, mid, qs, qe, 2 * si + 1) + getSumUtil(mid + 1, se, qs, qe, 2 * si + 2); 
        }
        int getMinUtil(int ss, int se, int qs, int qe, int si){
            if (qs <= ss && qe >= se){
                return st2[si]; 
            }
            if (se < qs || ss > qe) {
                return Integer.MAX_VALUE; 
            }
            int mid = getMid(ss, se); 
            return Math.min(getMinUtil(ss, mid, qs, qe, 2 * si + 1),getMinUtil(mid + 1, se, qs, qe, 2 * si + 2)); 
        }
        int getMaxUtil(int ss, int se, int qs, int qe, int si){
            if (qs <= ss && qe >= se){
                return st1[si]; 
            }
            if (se < qs || ss > qe) {
                return Integer.MIN_VALUE; 
            }
            int mid = getMid(ss, se); 
            return Math.max(getMaxUtil(ss, mid, qs, qe, 2 * si + 1),getMaxUtil(mid + 1, se, qs, qe, 2 * si + 2)); 
        }
        void updateValueUtil(int ss, int se, int i, int diff, int si){ 
            if (i < ss || i > se){
                return; 
            }
            st1[si] = st1[si] + diff; 
            if (se != ss) { 
                int mid = getMid(ss, se); 
                updateValueUtil(ss, mid, i, diff, 2 * si + 1); 
                updateValueUtil(mid + 1, se, i, diff, 2 * si + 2); 
            } 
        }
        void updateValue(int arr[], int n, int i, int new_val){
            if (i < 0 || i > n - 1) {
                return; 
            }
            int diff = new_val - arr[i]; 
            arr[i] = new_val; 
            updateValueUtil(0, n - 1, i, diff, 0); 
        }
        int getSum(int n, int qs, int qe){
            if (qs < 0 || qe > n - 1 || qs > qe) {
                return -1; 
            } 
            return getSumUtil(0, n - 1, qs, qe, 0); 
        }
        int getMin(int n, int qs, int qe){
            if (qs < 0 || qe > n - 1 || qs > qe) {
                return Integer.MIN_VALUE; 
            } 
            return getMinUtil(0, n - 1, qs, qe, 0); 
        }
        int getMax(int n, int qs, int qe){
            if (qs < 0 || qe > n - 1 || qs > qe) {
                return Integer.MAX_VALUE; 
            } 
            return getMaxUtil(0, n - 1, qs, qe, 0); 
        }
        int constructSTUtil1(int arr[], int ss, int se, int si){
            if (ss == se) { 
                st1[si] = arr[ss]; 
                return arr[ss]; 
            }
            int mid = getMid(ss, se); 
            st1[si] = Math.max(constructSTUtil1(arr, ss, mid, si * 2 + 1),constructSTUtil1(arr, mid + 1, se, si * 2 + 2)); 
            return st1[si]; 
        }
        int constructSTUtil2(int arr[], int ss, int se, int si){
            if (ss == se) { 
                st2[si] = arr[ss]; 
                return arr[ss]; 
            }
            int mid = getMid(ss, se); 
            st2[si] = Math.min(constructSTUtil2(arr, ss, mid, si * 2 + 1),constructSTUtil2(arr, mid + 1, se, si * 2 + 2)); 
            return st2[si]; 
        } 
    }
    public static double area(Point A, Point B, Point C){ 
        double area = (A.x * (B.y - C.y) + B.x * (C.y - A.y) + C.x * (A.y - B.y)) / (double)2; 
        return Math.abs(area);
    }
    public static void sort(int[] array){
		ArrayList<Integer> copy = new ArrayList<>();
		for(int i:array){
			copy.add(i);
		}
		Collections.sort(copy);
		for(int i=0;i<array.length;i++){
			array[i]=copy.get(i);
		}
    }
    static long[] fact(){
        long[] fac = new long[200001];
        fac[0] = (long)1;
        for (int i = 1; i < (int)fac.length; i++){
            fac[i] = (fac[i - 1] * i) % 1000000007;
        }
        return fac;
    }
    public static long nCr(long n, long r,long p,long[] fac){
        if (n<r) 
              return (long)0;
        if (r == 0)
            return (long)1;
        return (fac[(int)n] * modInverse(fac[(int)r], p)% p * modInverse(fac[(int)(n - r)], p)% p)% p;
    }
    public static long modInverse(long n, long p){
        return power(n, p - 2, p);
    }
    static long power(long x, long y, long p){
        long res = 1;
        x = x % p;
        while (y > 0) {
            if (y % 2 == 1)
                res = (res * x) % p;
            y = y >> 1; // y = y/2
            x = (x * x) % p;
        }
        return res;
    }
    public static int upp(int[] arr,int v){
        int low=0;
        int high=arr.length-1;
        int ans=-1;
        while(low<=high){
            int m=(low+high)/2;
            if(arr[m]<v){
                ans=m;
                low=m+1;
            }else{
                high=m-1;
            }
        }
        return ans;
    }
    public static int low(int[] arr,int v){
        int low=0;
        int high=arr.length-1;
        int ans=-1;
        while(low<=high){
            int m=(low+high)/2;
            if(arr[m]>v){
                ans=m;
                high=m-1;
            }else{
                low=m+1;
            }
        }
        return ans;
    }
    public static class Comp implements Comparator<pair>{
        public int compare(pair a,pair b){
            return a.x-b.x;
        }
    }
    public static int gcd(int a,int b){
        if (b == 0) 
        return a; 
        return gcd(b, a % b);
    }
    public static int lcm(int a,int b){
        int x=Math.max(a,b);
        int y=Math.min(a,b);
        long ans=x;
        while(ans%y!=0){
            ans+=x;
        }
        if(ans>Integer.MAX_VALUE){
            return -1;
        }
        return (int)ans;
    }
    public static class pair{
        int x;
        int y;
        public pair(int a,int b){
            x=a;
            y=b;
        }
    }
    public static int ans;
    public static void main(String[] args) throws IOException{
        FastScanner fs=new FastScanner();
		int t=1;
		t=fs.nextInt();
		long mod=1000000007;
		PrintWriter out=new PrintWriter(System.out);
		while(t-->0){
		    int n=fs.nextInt();
		    int[] arr=fs.readArray(2*n);
		    TreeMap<Integer,Integer> map1=new TreeMap<>();
		    for(int i=0;i<arr.length;i++){
		        map1.put(arr[i],map1.getOrDefault(arr[i],0)+1);
		    }
		    sort(arr);
		    int fir=map1.lastKey();
		    int l=fir;
		    if(map1.get(fir)>1){
		        map1.put(fir,map1.get(fir)-1);
		    }else{
		        map1.remove(fir);
		    }
		    int c=0;
		    for(int i=0;i<arr.length-1;i++){
		        int sec=arr[i];
		        TreeMap<Integer,Integer> map=new TreeMap<>(map1);
		        fir=l;
		        if(map.get(sec)>1){
		            map.put(sec,map.get(sec)-1);
		        }else{
		            map.remove(sec);
		        }
		        List<pair> list=new ArrayList<>();
		        while(list.size()!=n-1){
		            int max=map.lastKey();
		            int com=fir-max;
		            if(max==com && map.getOrDefault(max,0)<2){
		                break;
		            }
		            if(map.containsKey(com)){
		                if(map.get(com)>1){
		                    map.put(com,map.get(com)-1);
		                }else{
		                    map.remove(com);
		                }
		                if(map.get(max)>1){
		                    map.put(max,map.get(max)-1);
		                }else{
		                    map.remove(max);
		                }
		                list.add(new pair(max,com));
		                fir=max;
		            }else{
		                break;
		            }
		        }
		      //  if(sec==7){
		      //      System.out.println(list);
		      //  }
		        if(list.size()==n-1){
		            list.add(0,new pair(l,sec));
		            System.out.println("YES");
		            System.out.println(l+sec);
		            for(int j=0;j<list.size();j++){
		                System.out.println(list.get(j).x+" "+list.get(j).y);
		            }
		            c=1;
		            break;
		        }
		        map.put(sec,map.getOrDefault(sec,0)+1);
		    }
		    if(c==0){
		        System.out.println("NO");
		    }
		}
        out.close();
    }
}