#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>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int n;
	cin>>n;
	assert(2<=n && n<=100000);
	int a[100010];
	bool used[100010]={};
	for(int i=0; i<n; i++){
		cin>>a[i];
		assert(1<=a[i] && a[i]<=n);
		assert(!used[a[i]]);
		used[a[i]]=1;
	}
	if(a[0]>a[n-1]){
		cout<<"No"<<endl;
		return 0;
	}
	cout<<"Yes"<<endl;
	for(int i=1; i<n-1; i++){
		if(a[i]>a[0]) cout<<a[i]<<" ";
	}
	for(int i=n-2; i>0; i--){
		if(a[i]<a[0]) cout<<a[i]<<" ";
	}
	cout<<a[0]<<" ";
	cout<<endl;
	return 0;
}