#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};


template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

void solve() {
  int n; cin >> n;
  vector<int> vs(n);
  for (int i : range(n)) cin >> vs[i];

  if (vs[0] > vs[n - 1]) {
    cout << "No" << endl;
    return;
  }

  vector<int> res;
  vector<int> stk;
  stk.push_back(vs[0]);
  for (int i : range(1, n - 1)) {
    if (stk.back() > vs[i]) {
      stk.push_back(vs[i]);
    } else {
      res.push_back(vs[i]);
    }
    dump(i << " " << stk);
  }

  while (stk.size()) {
    res.push_back(stk.back());
    stk.pop_back();
  }

  cout << "Yes" << endl;
  for (int x : res) cout << x << " ";
  cout << endl;
}

int main() {
  cout << fixed << setprecision(12);
  solve();
}