// #define DEBUGGING
#include <bits/stdc++.h>
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
template <typename T> using V = std::vector<T>;
template <typename T> using VV = V<V<T>>;
using ll = std::int64_t;
using ull = std::uint64_t;
using PLL = std::pair<ll, ll>;
using TLL = std::tuple<ll, ll, ll>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }
#define mv_rec make_v(init, tail...)
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, size_t s, Tail... tail) { return V<decltype(mv_rec)>(s, mv_rec); }
#undef mv_rec
#ifdef DEBUGGING
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif
using namespace std;

template <typename T>
class SegmentTree {
public:
    ll size;
    vector<T> node;
    function<T(T, T)> comp;
    T identity_ele;  //comp(x, identity_ele) == x

    SegmentTree(const vector<T> &v, function<T(T, T)> comp, T identity_ele) 
        : comp(comp),
          identity_ele(identity_ele)
    {
        ll tmp = 1;
        while(tmp < v.size()) tmp = (tmp << 1);
        this->size = tmp;
        this->identity_ele = identity_ele;
        this->comp = comp;
        node = V<T>(2 * size - 1, identity_ele);
        for(ll i = 0; i < v.size(); i++) {
            node[i + size - 1] = v[i];
        }
        for(ll i = size - 2; 0 <= i; i--) {
            node[i] = comp(node[i * 2 + 1], node[i * 2 + 2]);
        }
    }

    void update(ll pos, T value) {
        pos += size - 1;
        node[pos] = value;
        while(pos > 0) {
            pos = (pos - 1) / 2;
            node[pos] = comp(node[2 * pos + 1], node[2 * pos + 2]);
        }
    }

    T query(ll a, ll b) {
        return sub_query(a, b, 0, 0, size);
    }

    T sub_query(ll a, ll b, ll k, ll l, ll r) {
        if(r <= a || b <= l) {
            return identity_ele;
        } else if(a <= l && r <= b) {
            return node[k];
        } else {
            T left = sub_query(a, b, k * 2 + 1, l, (l + r) / 2);
            T right = sub_query(a, b, k * 2 + 2, (l + r) / 2, r);
            return comp(left, right);
        }
    }
};

V<ll> ans;

bool solve() {
    ll N;
    cin >> N;
    V<ll> A(N);
    for(auto &&ele : A) cin >> ele;

    V<ll> min_v, max_v;
    ll left = A[0];
    for(ll i = 1; i < N; i++) {
        if(A[i - 1] < A[i] && i < N - 1) {
            ans.push_back(A[i]);
            continue;
        }
        ll right = A[(i + 1 == N ? i : i - 1)];
        if(ans.size() && ans.back() == right) ans.pop_back();
        min_v.push_back(left);
        max_v.push_back(right);
        left = A[i];
    }

    const ll inf = 5e15;
    SegmentTree<ll> min_st(min_v, [](ll a, ll b) { return max(a, b); }, -inf);
    SegmentTree<ll> max_st(max_v, [](ll a, ll b) { return min(a, b); }, inf);

    auto check = [&](ll val, ll i) {
        if(0 < i) {
            ll left = min_st.query(0, i);
            if(!(left < val)) return false;
        }
        if(i + 1 < min_v.size()) {
            ll right = max_st.query(i + 1, min_v.size());
            if(!(val < right)) return false;
        }
        return true;
    };

    for(ll i = 0; i < min_v.size(); i++) {
        ll l = min_v[i];
        ll r = max_v[i];
        bool ok = true;
        do {
            if(check(l, i)) {
                if(l != r) ans.push_back(r);
                break;
            }
            if(check(r, i)) {
                if(l != r) ans.push_back(l);
                break;
            }
            ok = false;
        } while(false);
        if(!ok) continue;
        for(ll j = 0; j < i; j++) ans.push_back(max_v[j]);
        for(ll j = i + 1; j < min_v.size(); j++) ans.push_back(min_v[j]);
        for(ll j = 0; j < i; j++) if(min_v[j] != max_v[j]) ans.push_back(min_v[j]);
        for(ll j = i + 1; j < min_v.size(); j++) if(min_v[j] != max_v[j]) ans.push_back(max_v[j]);
        return true;
    }
    return false;
}

int main() {
    bool ok = solve();
    if(ok) {
        cout << "Yes" << endl;
        for(ll i = 0; i < ans.size(); i++) cout << ans[i] << " \n"[i + 1 == ans.size()];
    } else {
        cout << "No" << endl;
    }
    return 0;
}