#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<cmath>

using namespace std;
typedef long long ll;

const int inf = 1e8;

int main(){
  int N; cin >> N;
  vector<int> a(N);
  for(int i = 0 ;i < N; i++){ cin >> a[i];}

  if( a[0] > a[N-1]){ cout << "No" << endl; return 0;}
  
  cout << "Yes" << endl;
  
  vector<int> ans;
  
  for(int i = 0; i < N-1; i++){
    if( a[0] < a[i]){ ans.push_back(a[i]);}
  }
  
  for(int i = N-1; i >= 0; i--){ //残っているのは右端を残し、全てa[0]未満の要素
    if(a[i] <= a[0]){ ans.push_back(a[i]);}
  }
  
  for(auto ne : ans){ cout << ne << " ";}
  
  cout << endl;
  
  return 0;
}