#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  sort(v.begin(), v.end(), greater<int>());
  deque<int> dq;
  bool flag = true;
  int left = v[1];
  int right = v[0];
  for (int i = 0; i < n; i++) {
    if (dq.size() < 2) {
      dq.push_back(v[i]);
    } else {
      if (flag == true) {
        flag = false;
        if (left + v[i] <= dq.front()) {
          cout << "NO" << endl;
          return 0;
        }
        left = dq.front();
        dq.push_front(v[i]);
      } else {
        flag = true;
        if (right + v[i] <= dq.back()) {
          cout << "NO" << endl;
          return 0;
        }
        right = dq.back();
        dq.push_back(v[i]);
      }
    }
  }
  if (left + dq.back() <= dq.front() || right + dq.front() <= dq.back()) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  for (auto it = dq.begin(); it != dq.end(); it++) {
    cout << *it << " ";
  }
  return 0;
}
