// #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;

V<ll> ans;

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

    V<PLL> sides;
    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();
        sides.emplace_back(left, right);
        left = A[i];
    }

    do {
        ll val = A[0];
        bool ok = true;
        for(ll i = 1; i < sides.size(); i++) {
            if(sides[i].second < val) {
                ok = false;
                break;
            }
        }
        if(!ok) break;
        for(ll i = 1; i < sides.size(); i++) ans.push_back(sides[i].first);
        for(ll i = 0; i < sides.size(); i++) if(sides[i].first != sides[i].second) ans.push_back(sides[i].second);
        return true;
    } while(false);

    DEBUG(sides);

    do {
        ll val = A.back();
        bool ok = true;
        for(ll i = 0; i + 1 < sides.size(); i++) {
            if(val < sides[i].first) {
                ok = false;
                break;
            }
        }
        if(!ok) break;
        reverse(ALL(sides));
        for(ll i = 1; i < sides.size(); i++) ans.push_back(sides[i].second);
        for(ll i = 0; i < sides.size(); i++) if(sides[i].first != sides[i].second) ans.push_back(sides[i].first);
        return true;
    } while(false);

    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;
}