#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a.begin(), a.end());
  deque<int> dq;
  for (int i = 0; i < n;) {
    dq.push_back(a[i]);
    i++;
    if (i < n) dq.push_front(a[i]);
    i++;
  }
  vector<long long> b;
  while (!dq.empty()) {
    b.push_back(dq.front());
    dq.pop_front();
  }
  for (int i = 0; i < n; i++) {
    if (b[i] >= b[(i + 1) % n] + b[(i - 1 + n) % n]) {
      cout << "NO\n";
      return 0;
    }
  }
  cout << "YES\n";
  for (int i = 0; i < n; i++) cout << b[i] << " ";
}
