#include <stdio.h>

#include <memory.h>

#include <math.h>

#include <string>

#include <vector>

#include <set>

#include <stack>

#include <queue>

#include <algorithm>

#include <map>

#define I scanf

#define OL puts

#define O printf

#define F(a,b,c) for(a=b;a<c;a++)

#define FF(a,b) for(a=0;a<b;a++)

#define FG(a,b) for(a=b-1;a>=0;a--)

#define LEN 1010

#define MAX (1<<30)-1

#define V vector<int>

using namespace std;

int pre[LEN];

vector<int> post;

bool isMirror=;

int n;

void set_post(int a,int b){

    if(a>b)return;

    if(a!=b){

        int i=a+;

        if(isMirror)

            while(i<=b && pre[i]>=pre[a]) i++;

        else

            while(i<=b && pre[i]<pre[a]) i++;

        int j=i;

        if(isMirror)

            while(j<=b && pre[j]<pre[a]) j++;

        else

            while(j<=b && pre[j]>=pre[a]) j++;

        set_post(a+,i-);

        set_post(i,j-);

    }

    post.push_back(pre[a]);

}

int main(){

//    freopen("1043_3.txt","r",stdin);

    I("%d",&n);

    int i;

    FF(i,n) I("%d",&pre[i]);

    set_post(,n-);

    bool isOK=;

    if(post.size()!=n){

        post.clear();

        isMirror=;

        set_post(,n-);

        if(post.size()!=n)

            isOK=;

    }

    if(isOK){

        puts("YES");

        FF(i,n){

            O("%d",post[i]);

            if(i!=n-)

                O(" ");

        }

    }else

        puts("NO");

    return ;

}