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.math.BigInteger;
import java.util.*;
import java.util.List;

import java.awt.*;

public class Main {

	static long sx = 0, sy = 0, mod = (long) (1e9 + 7);
	static int[][] dirs = { { 0, 1 }, { 1, 0 }, { 0, -1 }, { -1, 0 } };
	// static ArrayList<Integer>[] a;
	static ArrayList<Integer>[] g;
	static ArrayList<Integer>[] ra;
	// static int[] dp;
	static long[] fa;
	static int[] farr;
	public static PrintWriter out = new PrintWriter(System.out);
	static ArrayList<pair> pa = new ArrayList<>();
	static StringBuilder sb = new StringBuilder();
	static boolean cycle = false;
	static long m = 998244353;
	static long[] no, col;
	static String s;
	// static long k = 0, n = 0, ans = 0;
	static long cnt;
	// static long[] dp;
	// static long[] p;
	// static long[] ans;
	// static Double[][] a = new Double[2][2];
	static Double[] x;
	static Double[] y;
	static long[] d;
	static int[][] par;
	static long[] v;
	static HashMap<Integer, Integer> map;
	// static ArrayList<Integer> p;
	static int time = 0;
	static int[] id;
	static TreeSet<Long> hm;
	static int[] ans;
	static boolean[] prime;

	public static void main(String[] args) throws IOException {

		// Scanner scn = new Scanner(new BufferedReader(new
		// InputStreamReader(System.in)));
		Reader scn = new Reader();

		int to = scn.nextInt();
		StringBuilder sb1 = new StringBuilder();

		z: while (to-- != 0) {

			StringBuilder sb = new StringBuilder();
			int n = scn.nextInt();

			ArrayList<Integer> p = new ArrayList<>();

			TreeMap<Integer, Integer> hm = new TreeMap<>();

			for (int i = 0; i < 2 * n; i++) {

				int x = scn.nextInt();
				p.add(x);
				hm.put(x, hm.containsKey(x) ? hm.get(x) + 1 : 1);
			}

			Collections.sort(p);
			int lar = p.get(2 * n - 1);

			boolean ans = false;

			for (int i = 0; i < 2 * n - 1; i++) {

				int val = p.get(i);

				boolean b = f(new TreeMap<>(hm), lar + val);

				if (b) {
					ans = true;

					int sum = lar + val;

					sb.append(sum);
					sb.append("\n");

					while (hm.size() != 0) {

						int lar1 = hm.lastKey();
						hm.put(lar1, hm.get(lar1) - 1);

						if (hm.get(lar1) == 0)
							hm.remove(lar1);

						if (hm.containsKey(sum - lar1)) {

							int val1 = sum - lar1;
							hm.put(val1, hm.get(val1) - 1);

							if (hm.get(val1) == 0)
								hm.remove(val1);

							sb.append(lar1 + " " + val1);

							if (hm.size() != 0)
								sb.append("\n");

							sum = lar1;
						}

					}

					break;
				}

			}

			if (ans) {
				sb1.append("YES");
				sb1.append("\n");
				sb1.append(sb);
			}

			else
				sb1.append("NO");

			sb1.append("\n");
		}

		System.out.println(sb1);

	}

	private static boolean f(TreeMap<Integer, Integer> hm, int sum) {

		// sb = new StringBuilder();
		// sb.append(sum);
		// sb.append("\n");

		while (hm.size() != 0) {

			int lar = hm.lastKey();
			hm.put(lar, hm.get(lar) - 1);

			if (hm.get(lar) == 0)
				hm.remove(lar);

			if (hm.containsKey(sum - lar)) {

				int val = sum - lar;
				hm.put(val, hm.get(val) - 1);

				if (hm.get(val) == 0)
					hm.remove(val);

				// sb.append(lar + " " + val);
				//
				// if (hm.size() != 0)
				// sb.append("\n");

				sum = lar;
			}

			else {
				return false;
			}

		}

		return hm.size() == 0;
	}

	// _________________________TEMPLATE_____________________________________________________________

	// public static long lcm(long x, long y) {
	//
	// return (x * y) / gcd(x, y);
	// }
	//
	// private static long gcd(long x, long y) {
	// if (x == 0)
	// return y;
	//
	// return gcd(y % x, x);
	// }
	//
	// static class comp implements Comparator<Integer> {
	//
	// @Override
	// public int compare(Integer p1, Integer p2) {
	//
	// if (!hm1.contains(p1))
	// return -1;
	// else if (!hm1.contains(p2))
	// return 1;
	// else
	// return 0;
	//
	// }
	// }
	//
	// }
	//
	// public static long pow(long a, long b) {
	//
	// if (b < 0)
	// return 0;
	//
	// if (b == 0 || b == 1)
	// return (long) Math.pow(a, b);
	//
	// if (b % 2 == 0) {
	//
	// long ret = pow(a, b / 2);
	// ret = (ret % mod * ret % mod) % mod;
	// return ret;
	// }
	//
	// else {
	// return ((pow(a, b - 1) % mod) * a % mod) % mod;
	// }
	// }

	private static class pair implements Comparable<pair> {

		int i, a, b;

		pair(int c, int d, int e) {

			i = c;
			a = d;
			b = e;
		}

		@Override
		public int compareTo(pair o) {

			return this.b - o.b;
		}

		@Override

		public String toString() {

			return i + " " + a + " " + b;
		}

		// @Override
		//
		// public int hashCode() {
		// return (int) (a * 17+);
		// }
		//
		// @Override
		//
		// public boolean equals(Object o) {
		//
		// pair p = (pair) o;
		// return this.a == p.a;
		// }
		//
		// @Override
		//
		// public String toString() {
		// return this.a + " ";
		// }

	}

	private static String reverse(String s) {

		return new StringBuilder(s).reverse().toString();
	}

	public static class Reader {
		final private int BUFFER_SIZE = 1 << 16;
		private DataInputStream din;
		private byte[] buffer;
		private int bufferPointer, bytesRead;

		public Reader() {
			din = new DataInputStream(System.in);
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public Reader(String file_name) throws IOException {
			din = new DataInputStream(new FileInputStream(file_name));
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public String readLine() throws IOException {
			byte[] buf = new byte[1000000 + 1]; // line length
			int cnt = 0, c;
			while ((c = read()) != -1) {
				if (c == '\n')
					break;
				buf[cnt++] = (byte) c;
			}
			return new String(buf, 0, cnt);
		}

		public int nextInt() throws IOException {
			int ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (neg)
				return -ret;
			return ret;
		}

		public long nextLong() throws IOException {
			long ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public double nextDouble() throws IOException {
			double ret = 0, div = 1;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();

			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (c == '.') {
				while ((c = read()) >= '0' && c <= '9') {
					ret += (c - '0') / (div *= 10);
				}
			}

			if (neg)
				return -ret;
			return ret;
		}

		private void fillBuffer() throws IOException {
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
			if (bytesRead == -1)
				buffer[0] = -1;
		}

		private byte read() throws IOException {
			if (bufferPointer == bytesRead)
				fillBuffer();
			return buffer[bufferPointer++];
		}

		public void close() throws IOException {
			if (din == null)
				return;
			din.close();
		}

		public int[] nextIntArray(int n) throws IOException {
			int[] arr = new int[n];
			for (int i = 0; i < n; i++) {
				arr[i] = nextInt();
			}
			return arr;
		}

		public long[] nextLongArray(int n) throws IOException {
			long[] arr = new long[n];
			for (int i = 0; i < n; i++) {
				arr[i] = nextLong();
			}
			return arr;
		}

		public int[][] nextInt2DArray(int m, int n) throws IOException {
			int[][] arr = new int[m][n];
			for (int i = 0; i < m; i++) {
				for (int j = 0; j < n; j++)
					arr[i][j] = nextInt();
			}
			return arr;
		}

		public long[][] nextInt2DArrayL(int m, int n) throws IOException {
			long[][] arr = new long[m][n];
			for (int i = 0; i < m; i++) {
				for (int j = 0; j < n; j++)
					arr[i][j] = nextInt();
			}
			return arr;
		}
		// kickstart - Solution
		// atcoder - Main
	}

}