#include<iostream>
#include<vector>
using namespace std;

struct Node{
    int x;
    Node* right;
    Node* left;
};

Node* newNode(int val){
    Node* t = (Node*)(malloc(sizeof(Node)));
    t->x = val;
    t->left = NULL;
    t->right = NULL;
    return t;
}

int main(){
    int n;
    cin >> n;
    vector<int> v(n);
    for(int i = 0; i < n; i++)  cin >> v[i];
    if(v[0] == n){
        cout << "No" << endl;
        return 0;
    }
    if(v.back() == n){
        cout << "Yes" << endl;
        for(int i = n-2; i >= 0; i--)   cout << v[i] << " \n"[i==0];
        return 0;
    }
    for(int i = 0; i < n; i++)  v[i]--;
    vector<Node*> vn;
    for(int i = 0; i < n; i++){
        vn.push_back(newNode(i));
    }
    for(int i = 0; i+1 < n; i++){
        vn[v[i]]->right = vn[v[i+1]];
    }
    for(int i = 1; i < n; i++){
        vn[v[i]]->left = vn[v[i-1]];
    }
    vector<int> ans;
    vector<bool> used(n, 0);
    for(int i = 0; i < n-1; i++){
        if(vn[i]->right == NULL){
            cout << "No" << endl;
            return 0;
        }
        while(vn[i]->right->right != NULL){
            used[vn[i]->right->x] = true;
            ans.push_back(vn[i]->right->x);
            vn[i]->right->right->left = vn[i];
            vn[i]->right = vn[i]->right->right;
        }
        used[i] = true;
        ans.push_back(i);
        if(ans.size() == n-2){
            for(int j = 0; j < n; j++){
                if(!used[j]){
                    ans.push_back(j);
                    break;
                }
            }
        }else if(ans.size() == n-1){
            break;
        }
        vn[i]->right->left = vn[i]->left;
        if(vn[i]->left != NULL)  vn[i]->left->right = vn[i]->right;
    }
    cout << "Yes" << endl;
    for(int i = 0; i < n-1; i++){
        cout << ans[i]+1 << " \n"[i+1==n-1];
    }
    return 0;
}