//#define _GLIBCXX_DEBUG #include "bits/stdc++.h" using namespace std; //------------------------------- Libraries --------------------------------// //------------------------------- Type Names -------------------------------// using i64 = int_fast64_t; using seika = string; //{akari : 1D, yukari : 2D, maki : 3D} vector template using akari = vector; template using yukari = akari>; template using maki = akari>; //{akane : ascending order, aoi : decending order} priority queue template using akane = priority_queue, greater>; template using aoi = priority_queue; //------------------------------- Dubug Functions ---------------------------// inline void print() { cout << endl; } template void print(const First &first, const Rest &... rest) { cout << first << ' '; print(rest...); } //------------------------------- Solver ------------------------------------// void solve() { int n; cin >> n; akari as(n), ans; for (int i = 0; i < n; i++) { cin >> as[i]; } if (as.front() > as.back()) { cout << "No" << endl; return; } int l = 0, r = n - 1; akari ls, rs; while (l + 1 < r) { int nl = l + 1; if (nl < r && as[l] < as[nl]) { ans.push_back(as[nl]); nl++; } int nr = r - 1; if (nr > nl && as[nr] < as[r]) { ans.push_back(as[nr]); nr--; } if (nl < r) ls.push_back(as[nl]); if (nl < nr) rs.push_back(as[nr]); r = nr, l = nl; //print(l, r); } for (int x : ls) { ans.push_back(x); } for (int x : rs) { ans.push_back(x); } cout << "Yes" << endl; ans.push_back(as[0]); for (int a : ans) { cout << a << ' '; } cout << endl; } int main() { solve(); return 0; }