#include <iostream>
#include <vector>

using namespace std;

constexpr int INF = 1 << 30;

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int n;
    cin >> n;
    vector<int> a(n+1);
    for(int i=0;i<n;++i){
        cin >> a[i];
    }

    int start = 0, i = 1;
    vector<int> ans;
    vector<int> rest(1, a[0]);
    bool is_succeeded = true;
    while(i < n) {
        if(a[i-1] > a[i]) {
            if(i-start < 2) {
                is_succeeded = false;
                break;
            }
            for(int j=start;j<i;++j) if(rest.back() != a[j]) ans.push_back(a[j]);
            rest.push_back((rest[0] < a[i]) ? a[i] : INF);
            start = i;
        }
        if((rest.size() == 1 || rest[0] < a[i]) && a[i] < rest.back()) rest.back() = a[i];
        ++i;
    }

    for(int j=start;j<n;++j) if(rest.back() != a[j]) ans.push_back(a[j]);

    if(!is_succeeded) {
        cout << "No" << endl;
    } else {
        cout << "Yes" << endl;

        for(int i=0;i<rest.size()-1;++i) ans.push_back(rest[i]);

        for(int x: ans) cout << x << " ";
        cout << endl;
    }


}