#include <bits/stdc++.h>
using namespace std;
int a[100009], ans[100009], idx;
bool cmp(int a, int b) { return a > b; }
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + 1 + n);
  for (int i = 1; i <= n; i++) {
    i++;
    if (i > n) break;
    ans[idx] = a[i];
    idx++;
    a[i] = 0;
  }
  sort(a, a + 2 + n, cmp);
  for (int i = 0; i <= n; i++) {
    if (a[i] == 0) break;
    ans[idx] = a[i];
    idx++;
  }
  assert(idx == n);
  if (ans[0] >= ans[idx - 1] + ans[1]) {
    cout << "NO";
    return 0;
  }
  if (ans[n - 1] >= ans[0] + ans[n - 2]) {
    cout << "NO";
    return 0;
  }
  for (int i = 1; i < n - 1; i++) {
    if (ans[i] >= ans[i - 1] + ans[i + 1]) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES" << endl;
  for (int i = 0; i < idx; i++) {
    cout << ans[i] << " ";
  }
}
