import java.util.*;
import java.io.*;
import java.text.*;
//Solution Credits: Taranpreet Singh
public class Main{
    //SOLUTION BEGIN
    void pre() throws Exception{}
    void solve(int TC) throws Exception{
        int n = ni();
        int[] f = new int[n+1];
        for(int i = 0; i< n; i++)f[ni()]++;
        for(int i = 2; i<= n; i++)f[i-1]-=f[i];
        for(int i:f){
            if(i<0){
                pn("No");
                return;
            }
        }
        MyTreeSet<Integer> odd = new MyTreeSet<>(), even = new MyTreeSet<>(), terminal = new MyTreeSet<>();
        for(int i = n; i>= 1; i--){
            while(f[i]>1){
                even.add(i);
                f[i]-=2;
            }
            if(f[i]==1 && i-1>=1 && f[i-1]>0){
                odd.add(i);
                f[i]--;
                f[i-1]--;
            }else if(f[i]==1)terminal.add(i);
        }
        while(terminal.size()>2 && terminal.first()==1){
            hold(terminal.remove(1));
            odd.add(1);
        }
        if(terminal.size()> 2 || odd.size()+even.size()+1>f[0])pn("No");
        else{
            pn("Yes");
            if(!terminal.isEmpty()){
                int x = terminal.first();terminal.remove(x);
                while(x>0){
                    p(x--+" ");
                }
            }
            p("0 ");f[0]--;
            while(!odd.isEmpty()){
                int x = odd.first();hold(odd.remove(x));
                for(int i = 1; i<= x; i++)p(i+" ");
                for(int i = x-1; i>= 1; i--)p(i+" ");
                p("0 ");f[0]--;
            }
            while(!even.isEmpty()){
                int x = even.first();hold(even.remove(x));
                for(int i = 1; i<= x; i++)p(i+" ");
                for(int i = x; i>= 1; i--)p(i+" ");
                p("0 ");f[0]--;
            }
            while(f[0]>0){
                p("0 ");f[0]--;
            }
            if(!terminal.isEmpty()){
                int x = terminal.last();
                for(int i = 1; i<= x; i++)p(i+" ");
            }
            pn("");
        }
    }
    class MyTreeSet<T>{
        private int size;
        private TreeMap<T, Integer> map;
        public MyTreeSet(){
            size = 0;
            map = new TreeMap<>();
        }
        public int size(){return size;}
        public int dsize(){return map.size();}
        public boolean isEmpty(){return size==0;}
        public void add(T t){
            size++;
            map.put(t, map.getOrDefault(t, 0)+1);
        }
        public boolean remove(T t){
            if(!map.containsKey(t))return false;
            size--;
            int c = map.get(t);
            if(c==1)map.remove(t);
            else map.put(t, c-1);
            return true;
        }
        public int freq(T t){return map.getOrDefault(t, 0);}
        public boolean contains(T t){return map.getOrDefault(t,0)>0;}
        public T ceiling(T t){return map.ceilingKey(t);}
        public T floor(T t){return map.floorKey(t);}
        public T first(){return map.firstKey();}
        public T last(){return map.lastKey();}
    }
    //SOLUTION END
    void hold(boolean b)throws Exception{if(!b)throw new Exception("Hold right there, Sparky!");}
    long mod = (long)1e9+7, IINF = (long)1e10;
    final int INF = (int)1e9, MX = (int)1e4+1;
    DecimalFormat df = new DecimalFormat("0.000000000000000");
    double PI = 3.1415926535897932384626433832792884197169399375105820974944, eps = 1e-8;
    static boolean multipleTC = true, memory = false;
    FastReader in;PrintWriter out;
    void run() throws Exception{
        in = new FastReader();
        out = new PrintWriter(System.out);
        int T = (multipleTC)?ni():1;
        //Solution Credits: Taranpreet Singh
        pre();for(int t = 1; t<= T; t++)solve(t);
        out.flush();
        out.close();
    }
    public static void main(String[] args) throws Exception{
        if(memory)new Thread(null, new Runnable() {public void run(){try{new Main().run();}catch(Exception e){e.printStackTrace();}}}, "1", 1 << 28).start();
        else new Main().run();
    }
    long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}
    int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}
    int bit(long n){return (n==0)?0:(1+bit(n&(n-1)));}
    void p(Object o){out.print(o);}
    void pn(Object o){out.println(o);}
    void pni(Object o){out.println(o);out.flush();}
    String n()throws Exception{return in.next();}
    String nln()throws Exception{return in.nextLine();}
    int ni()throws Exception{return Integer.parseInt(in.next());}
    long nl()throws Exception{return Long.parseLong(in.next());}
    double nd()throws Exception{return Double.parseDouble(in.next());}

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

        public FastReader(String s) throws Exception{
            br = new BufferedReader(new FileReader(s));
        }

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

        String nextLine() throws Exception{
            String str = "";
            try{   
                str = br.readLine();
            }catch (IOException e){
                throw new Exception(e.toString());
            }  
            return str;
        }
    }
}