#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define inf (int)(1e9+7)
#define abs(x) (x >= 0 ? x : -(x))
#define ceil(a, b) a / b + !!(a % b)
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }






int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    
    int n;
    cin >> n;
    vector<int> a(n);
    rep(i, n) cin >> a[i];
    // a is a permutation
    if (a[0] > a[n - 1]) { cout << "No" << endl; return 0; }
    
    int table[100005] = {0};
    vector<int> ans;
    
    rep3(i, 1, n - 1) {
        // 左からa[0]より大きいの削除
        // 左隣はa[0]以下
        if (a[i] < a[0]) { table[i] = 1; ans.eb(a[i]); }
    }
    // 1 ~ n-2で, すべてa[0]以下
    // 右隣は常にa[n-1]
    for (int i = n - 2; i >= 1; --i) {
        if (a[i] >= a[0]) { table[i] = 1; ans.eb(a[i]); }
    }
    // rep(i, n) cout << table[i] << " "; cout << endl;
    ans.eb(a[0]);
    cout << "Yes" << endl;
    rep(i, sz(ans)) cout << ans[i] << " "; cout << endl;
}