#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N;
	cin >> N;
	set<ll> ST;
	rep(i, N) {
		int a;
		cin >> a;
		ST.insert(((ll)i << 20) + a);
	}

	int m = (1 << 20) - 1;
	int a1 = *ST.begin() & m;
	int aN = *(--ST.end()) & m;

	auto itr = ST.begin();
	vector<int> kotae;

	while (itr != --ST.end()) {
		int k = *itr >> 20;
		int a = *itr & m;
		int b = *(++itr) & m;
		if (a < b) {
			if (a < a1) {
				kotae.pb(a);
				--itr;
				auto tugi = --itr;
				ST.erase(++itr);
				itr = tugi;
			}
			else if (b > aN) {
				kotae.pb(b);
				ST.erase(itr);
				itr = ST.lower_bound((ll)k << 20);
			}
		}
	}

	int muri = 0;
	for (itr = ++ST.begin(); itr != ST.end(); itr++) {
		int a = *(--itr) & m;
		int b = *(++itr) & m;
		if (a < b) kotae.pb(*itr& m);
		else muri = 1;
	}

	if (muri) co("No");
	else {
		co("Yes");
		rep(i, N - 1) {
			if (i != N - 2) cosp(kotae[i]);
			else co(kotae[i]);
		}
	}
	Would you please return 0;
}