#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;

template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
    os<<p.first<<" "<<p.second;
    return os;
}

template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==v.size()?"":" ");
    return os;
}

template<typename Monoid>
struct SegmentTree{
    using F=function<Monoid(Monoid,Monoid)>;
    int sz;
    vector<Monoid> seg;
    const F f;
    const Monoid gen;
    SegmentTree(int n,const F f,const Monoid &gen):f(f),gen(gen){
        sz=1;
        while(sz<n)sz<<=1;
        seg.assign(2*sz,gen);
    }
    void set(int k,const Monoid &x){
        seg[k+sz]=x;
    }
    void build(){
        for(int k=sz-1;k>0;k--) seg[k]=f(seg[2*k],seg[2*k+1]);
    }
    void update(int k,const Monoid &x){
        k+=sz;
        seg[k]=x;
        while(k>>=1) seg[k]=f(seg[2*k],seg[2*k+1]);
    }
   // [a,b)
    Monoid query(int a,int b){
        Monoid L=gen,R=gen;
        for(a+=sz,b+=sz;a<b;a>>=1,b>>=1){
            if(a&1) L=f(L,seg[a++]);
            if(b&1) R=f(seg[--b],R);
        }
        return f(L,R);
    }
    Monoid operator[](const int &k)const {
       return seg[k+sz];
    }
};

using P=pair<int,int>;
P f(P a,P b){
    return a<b?a:b;
}
P g(P a,P b){
    return a>b?a:b;
}

signed main(){
    int n;cin>>n;
    vector<int> a(n);
    rep(i,n) cin>>a[i];
    if(a[0]>a[n-1]){
        cout<<"No"<<endl;
        return 0;
    }
    cout<<"Yes"<<endl;

    SegmentTree<P> segmin(n,f,make_pair(INF,INF)),segmax(n,g,make_pair(-1,-1));
    rep(i,n) segmax.set(i,make_pair(a[i],i)),segmin.set(i,make_pair(a[i],i));
    segmax.build();
    segmin.build();


    set<int> st;
    rep(i,n)st.insert(i);

    vector<int> ans;
    while(st.size()>1){
        {
            auto mip=segmin.query(0,n);
            // cout<<mip<<endl;
            int idx=mip.second;
            auto ite=st.find(idx);
            auto er=next(ite);
            while(er!=prev(st.end())){
                ans.push_back(a[*er]);
                segmin.update(*er,make_pair(INF,*er));
                segmax.update(*er,make_pair(-1,*er));
                er=st.erase(er);
            }
            ans.push_back(a[*ite]);
            segmin.update(*ite,make_pair(INF,*ite));
            segmax.update(*ite,make_pair(-1,*ite));
            st.erase(mip.second);
        }
        {
            auto mxp=segmax.query(0,n);
            // cout<<mxp<<endl;
            int idx=mxp.second;
            auto ite=st.find(idx);
            auto er=prev(ite);
            while(er!=st.begin()){
                ans.push_back(a[*er]);
                segmin.update(*er,make_pair(INF,*er));
                segmax.update(*er,make_pair(-1,*er));
                er=st.erase(er);
                er=prev(er);
            }
            ans.push_back(a[*ite]);
            segmin.update(*ite,make_pair(INF,*ite));
            segmax.update(*ite,make_pair(-1,*ite));
            st.erase(mxp.second);
        }
    }
    rep(i,ans.size()) cout<<ans[i]<<(i+1==ans.size()?"\n":" ");
    return 0;
}