#include <bits/stdc++.h>
using namespace std;

#define FOR(i, m, n) for(int (i) = (m); (i) < (n); (i)++)
#define FORN(i, m, n) for(int (i) = (m); (i) <= (n); (i)++)
#define FORR(i, m, n) for(int (i) = (m); (i) >= (n); (i)--)
#define rep(i, n) FOR(i, 0, n)
#define repn(i, n) FORN(i, 1, n)
#define repr(i, n) FORR(i, n, 0)
#define repnr(i, n) FORR(i, n, 1)
#define co(n) cout << (n) << endl
#define cosp(n) cout << (n) << ' '
#define setp(n) cout << fixed << setprecision(n);
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> Vec;

const ll INF = 1e9+1;
const ll LINF = 1e18+1;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const double PI = acos(-1);
const double EPS = 1e-9;

int main(void){
	ll n;
	cin >> n;
	Vec a(n);
	rep(i, n){
		cin >> a[i];
	}

	if(a[0] >= a[n-1]){
		puts("No");
		return 0;
	}

	puts("Yes");
	while(n > 2){
		repn(i, n-2){
			if(a[i-1] < a[i]){
				cosp(a[i]);
				a.erase(a.begin()+i);
				i--;
				n--;
			}
		}

		repnr(i, n-2){
			if(a[i] < a[i+1]){
				cosp(a[i]);
				a.erase(a.begin()+i);
				n--;
			}
		}
	}
	co(a[0]);
	
	return 0;
}