#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  if (a[n - 1] >= a[n - 2] + a[n - 3]) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  deque<int> q;
  while (!q.empty()) q.pop_back();
  for (int i = n - 1; i >= 0; i--) {
    q.push_back(a[i]);
    i--;
    if (i >= 0) q.push_front(a[i]);
  }
  while (!q.empty()) {
    cout << q.front() << " ";
    q.pop_front();
  }
  return 0;
}
