#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)
#if DEBUG
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) /* ... */
#endif

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 123450
#endif

int N;
int A[SIZE];
vector<int> que, ans;

void solve() {
    cin>>N;
    REP(i,N)cin>>A[i];
    que.push_back(A[0]);
    REP1(i,N-1) {
        while (que.back() < A[i] && que.size() >= 2) {
            ans.push_back(que.back());
            que.pop_back();
        }
        if (que.back() < A[i]) {
            ans.push_back(A[i]);
        } else {
            que.push_back(A[i]);
        }
    }
    if (que.size()==1) {
        out("Yes\n");
        for (int n:ans) out("%lld ", n);
        out("\n");
    } else {
        out("No\n");
    }
}