#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
const ll inf = 1e16;
const ll md = 1000000007;

int main() {
  int n;
  cin>>n;
  vi aa(n);
  vi ans;
  rep(i,n) cin>>aa[i];
  int top=aa[0];
  int end=n;
  int ti=0;
  int pre=-1;
  vector<bool> fin(n+1,false);
  rep(i,n){
    fin[aa[i]]=true;
    if (aa[i]!=end) continue;
    //cout<<pre<<" "<<top<<" "<<end<<endl;
    for (int j=i-1;j>ti;j--) ans.push_back(aa[j]);
    if(pre==-1){
      ans.push_back(end);
      pre=top;
    }else if (top>pre){
      if(top!=end) ans.push_back(end);
      pre=min(pre,top);
      ans.push_back(max(pre,top));
    }else if(end>pre){
      if(top!=end) ans.push_back(top);
      pre=min(pre,end);
      ans.push_back(max(pre,end));
    }else{
      puts("No");
      return 0;
    }
    if (i==n-1) break;
    //cout<<pre<<" "<<top<<" "<<end<<endl;
    while (fin[end]) end--;
    ti=i+1;
    top=aa[ti];
  }
  puts("Yes");
  rep(i,n-1){
    cout<<ans[i];
    if (i==n-2) break;
    cout<<" ";
  }
  cout<<endl;
  return 0;
}