#include <bits/stdc++.h>
using namespace std;
using lint = long long;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;

template<class Z> Z rng(Z a, Z b) {
  static mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
  return uniform_int_distribution<Z>(a, b - 1)(mt);
}

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  int n; cin >> n;
  V<> a(n); for (auto&& e : a) cin >> e;
  using namespace chrono;
  auto start_t = steady_clock::now();
  auto solve = [&]() -> void {
    V<> l(n), r(n);
    for (int i = 0; i < n; ++i) {
      l[i] = i - 1;
      r[i] = i + 1;
    }
    V<> res;
    V<bool> used(n);
    auto chk = [&](int i) -> bool {
      if (used[i]) return false;
      if (l[i] >= 0 and a[l[i]] < a[i]) return true;
      if (r[i] < n and a[i] < a[r[i]]) return true;
      return false;
    };
    int cnt = 0;
    while (true) {
      int i = rng(0, n);
      if (chk(i)) {
        used[i] = true;
        res.push_back(a[i]);
        if (l[i] >= 0) {
          r[l[i]] = r[i];
        }
        if (r[i] < n) {
          l[r[i]] = l[i];
        }
        cnt = 0;
      }
      ++cnt;
      if (cnt > 3 * n) return;
      if (res.size() == n - 1) {
        cout << "Yes" << '\n';
        for (int i = 0; i < n - 1; ++i) {
          cout << res[i] << " \n"[i == n - 2];
        }
        exit(0);
      }
    }
  };
  while (duration_cast<milliseconds>(steady_clock::now() - start_t).count() < 1800) {
    solve();
  }
  cout << "No" << '\n';
}