//#define _GLIBCXX_DEBUG
#include "bits/stdc++.h"

using namespace std;

//------------------------------- Libraries --------------------------------//

//------------------------------- Type Names -------------------------------//

using i64 = int_fast64_t;

using seika = string;
//{akari : 1D, yukari : 2D, maki : 3D} vector
template <class kizuna>
using akari = vector<kizuna>;
template <class yuzuki>
using yukari = akari<akari<yuzuki>>;
template <class tsurumaki>
using maki = akari<yukari<tsurumaki>>;
//{akane : ascending order, aoi : decending order} priority queue
template <class kotonoha>
using akane = priority_queue<kotonoha, akari<kotonoha>, greater<kotonoha>>;
template <class kotonoha>
using aoi = priority_queue<kotonoha>;

//------------------------------- Dubug Functions ---------------------------//
inline void print()
{
    cout << endl;
}
template <typename First, typename... Rest>
void print(const First &first, const Rest &... rest)
{
    cout << first << ' ';
    print(rest...);
}
//------------------------------- Solver ------------------------------------//

void solve()
{
    int n;
    cin >> n;
    akari<int> as(n), ans;
    for (int i = 0; i < n; i++)
    {
        cin >> as[i];
    }
    if (as.front() > as.back())
    {
        cout << "No" << endl;
        return;
    }
    int l = 1, r = n - 2;
    while (l <= r)
    {
        if (as[0] < as[l] || as[l] < as[l + 1])
        {
            ans.push_back(as[l]);
            l++;
        }
        else if (as[r] < as[n - 1] || as[r - 1] < as[r])
        {
            ans.push_back(as[r]);
            r--;
        }
        else
        {
            cout << "No" << endl;
            return;
        }
    }
    cout << "Yes" << endl;
    ans.push_back(as[0]);
    for (int a : ans)
    {
        cout << a << ' ';
    }
    cout << endl;
}

int main()
{
    solve();
    return 0;
}