#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
int n;
int mx[18][100002];
int a[100002];
vector<int> ans;
void solve(int p, int l, int r){
    if(l>=r) return;
    if(p==0) ans.push_back(a[l]);
    else ans.push_back(a[r]);
    if(l+1==r) return;
    if(a[l]<a[r-1]){
        solve(1, l, r-1);
        return;
    }
    int m=r-1;
    for(int i=17; i>=0; i--){
        if(m-(1<<i)+1<0 || mx[i][m]>=a[l]) continue;
        m-=(1<<i);
    }
    solve(1, l, m);
    solve(0, m+1, r);
}
int main()
{
    cin>>n;
    for(int i=0; i<n; i++){
        cin>>a[i];
    }
    if(a[0]>a[n-1]){
        cout<<"No"<<endl;
        return 0;
    }
    cout<<"Yes"<<endl;
    for(int i=0; i<n; i++){
        mx[0][i]=a[i];
        for(int j=1; i-(1<<j)+1>=0; j++){
            mx[j][i]=max(mx[j-1][i], mx[j-1][i-(1<<(j-1))]);
        }
    }
    solve(0, 0, n-1);
    for(int i=n-2; i>=0; i--){
        cout<<ans[i];
        if(i>0) cout<<" ";
    }
    cout<<endl;
    return 0;
}