#include<bits/stdc++.h>
using namespace std;
 
#define int long long 
 
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
 
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}
 
template<class A,class B>
ostream& operator<<(ostream& ost,const pair<A,B>&p){
	ost<<"{"<<p.first<<","<<p.second<<"}";
	return ost;
}
 
template<class T>
ostream& operator<<(ostream& ost,const vector<T>&v){
	ost<<"{";
	for(int i=0;i<v.size();i++){
		if(i)ost<<",";
		ost<<v[i];
	}
	ost<<"}";
	return ost;
}




signed main(){
	int N;
	cin>>N;
	vint A(N);rep(i,N)cin>>A[i],A[i]--;

	vint pos(N);
	rep(i,N)pos[A[i]]=i;
	set<int>idx;
	rep(i,N)idx.insert(i);

	vint ans;
	for(int i=0;i<N-1;i++){
		int p=pos[i];
		if(*idx.begin()==p){
			idx.erase(p);
			while(idx.size()){
				ans.pb(A[*idx.begin()]);
				idx.erase(*idx.begin());
			}
			break;
		}
		if(p==*idx.rbegin())break;
		ans.pb(i);
		idx.erase(p);
	}

	if(ans.size()!=N-1)puts("No");
	else{
		puts("Yes");
		rep(i,ans.size()){
			if(i)printf(" ");
			printf("%lld",ans[i]+1);
		}
		puts("");
	}
	return 0;
}