#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000

int main(){
	
	int N;
	cin>>N;
	
	vector<int> a(N);
	for(int i=0;i<N;i++)cin>>a[i];
	
	if(a[0]>a.back()){
		cout<<"No"<<endl;
		return 0;
	}
	vector<int> ans;
	vector<bool> X(N,false);
	deque<int> d;
	int l = -1;
	for(int i=1;i<N-1;i++){
		if(i==1){
			l=a[i];
			d.push_back(l);
		}
		else{
			if(a[i]>l){
				ans.push_back(a[i]);
				X[i]=true;
			}
			else{
				l=a[i];
				d.push_back(l);
			}
		}
	}
	
	while(d.size()!=0){
		if(d.front()>a[0]){
			ans.push_back(d.front());
			d.pop_front();
		}
		else{
			ans.push_back(d.back());
			d.pop_back();
		}
	}
	
	ans.push_back(a[0]);
	
	cout<<"Yes"<<endl;
	
	for(int i=0;i<ans.size();i++){
		if(i!=0)cout<<' ';
		cout<<ans[i];
	}
	cout<<endl;
	
	
	return 0;
	
}