#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

ll N;
vector<ll> a;
vector<ll> res;
void dfs(ll l, ll r, ll ls, ll rs) {
	if (l > r) return;
	if (l == r) {
		res.push_back(a[l]);
		return;
	}

	if (a[l] < a[r]) {
		dfs(l + 1, r - 1,a[l], a[r]);
		res.push_back(a[l]);
		res.push_back(a[r]);
	}
	else {
		if (ls < a[l]) {
			res.push_back(a[l]);
			dfs(l + 1, r, ls, rs);
		}
		else if (a[r] < rs) {
			res.push_back(a[r]);
			dfs(l, r - 1, ls, rs);
		}
	}
}

int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	scanf("%lld", &N); 
	a.resize(N); for (ll i = 0; i < N; i++) scanf("%lld", &a[i]);
	if (a[0] > a.back()) puts("No");
	else {
		puts("Yes");
		dfs(1, N - 2, a[0], a.back());
		for (ll i = 0; i < N - 2; i++) {
			printf("%lld ", res[i]);
		}
		printf("%lld\n", a[0]);
	}
	return 0;
}