#include <bits/stdc++.h>
 #define ll long long
 #define ull unsigned long long
 #define pi 3.141592654
 #define NUM 1e18
 #define Mod  1'000'000'007
 #define fixed(n) fixed<<setprecision(n)
 #define cin(v) for(auto &i:v) cin >> i ;
 #define cout(v) for(auto &i:v) cout << i  <<" ";
 #define vowel(x) (x=='e'||x=='a'||x=='i'||x=='o'||x=='u')
 #define small(x) (x>=97&&x<=122)
 #define capital(x) (x>=65&&x<=90)
 #define Tolower(s) transform(s.begin(),s.end(),s.begin(),::tolower);
 #define Toupper(s) transform(s.begin(),s.end(),s.begin(),::toupper);
 #define sz(x) (int)(x.size())
 #define all(v) ((v).begin()), ((v).end())
 #define allr(v) ((v).rbegin()), ((v).rend())
 #define updmax(a,b) a=max(a,b)
 #define updmin(a,b) a=min(a,b)
 #define ceil(a,b) ((a/b)+(a%b?1:0))
 /* asc -> 1 2 3 ,des -> 3 2 1 */

 /***********************************************************************************/
 using namespace std;
 void Rofyda_Elghadban(){
  #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
   #endif
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
 }

 void solve(){
  int n,n1=0,n2=0,counter=1,idx=0,flag=0;
  cin>>n;
  vector<int>v(n),v1,ans,temp;
  cin(v);
  v1=v;
  for(int i=0;i<v.size();i++){
    if(i+1<v.size()&&v[i]==v[i+1]){
      counter++;
      if(v[i]>9){
        n2=v1[i]%10;
        v1[i]/=10;
        n1=v1[i]%10;
        v1[i]/=10;
        temp.push_back(n1);
        temp.push_back(n2);
      }else{
        temp.push_back(v1[i]);
      }
    }

    else
    if(counter>1){
      i--;
    }
    if(i+1<v.size()&&v[i]>v[i+1]){
      // if(counter>1){
      //   while(counter>0){
      //     // ans.pop_back();
      //     counter--;
      //   }
      // }
      counter=1;
      while(temp.size()>0){
        idx=temp.size()-1;
        ans.push_back(temp[idx]);
        idx--;
        temp.pop_back();
        // flag++;
      }
      // if(flag==0){
        if(v[i]>9){
          n2=v[i]%10;
          v[i]/=10;
          n1=v[i]%10;
          v[i]/=10;
          ans.push_back(n1);
          ans.push_back(n2);
        }else{
          ans.push_back(v[i]);
        }
      // }
      // flag=0;
    }

    else{
    //   if(counter>1){
    //   i--;
    // }
      if(counter>1){
        while(counter>1){
          ans.push_back(v[i]);
          counter--;
        }
      }
      counter=1;
    //   while(temp.size()>0){
    //     idx=temp.size()-1;
    //     ans.push_back(temp[idx]);
    //     idx--;
    //     temp.pop_back();
    //   }
    //   counter=1;
      ans.push_back(v[i]);
    }
  }
  // if(ans[ans.size()-1]==v[n-1]){
  //   ans.push_back(ans[ans.size()-1]);
  // }
  cout(ans);
  cout<<"\n";
  for(int i=0;i<ans.size();i++){
    if(i+1<ans.size()&&ans[i]>ans[i+1]){
      cout<<"NO"<<"\n";
      return;
    }
  }
  cout<<"YES"<<"\n";
 }

 int main(){
  Rofyda_Elghadban();
  int t=1;
  cin>>t;
  while(t--){
    solve();
  }
  return 0;
 }