#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "URDL";
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 998244353) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 998244353) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
int a[200135], vis[200135];
vector<int> vp[2];
void fmain(int tid) {
  scanf("%d", &n);
  for (int(i) = 1; (i) <= (int)(n); (i)++) {
    scanf("%d", a + i);
  }
  vp[1].push_back(0);
  a[0] = (1 << 30);
  vp[0].push_back(n + 1);
  a[n + 1] = -1;
  for (int(i) = 1; (i) <= (int)(n); (i)++) {
    bool ok0 = a[vp[0].back()] < a[i];
    bool ok1 = a[vp[1].back()] > a[i];
    if (!ok0 && !ok1) etp();
    if (ok0 && ok1) {
      if (a[i + 1] > a[i])
        vp[0].push_back(i);
      else
        vp[1].push_back(i);
    } else if (ok0)
      vp[0].push_back(i);
    else
      vp[1].push_back(i);
  }
  for (int z : vp[1]) vis[z] = 1;
  puts("YES");
  for (int(i) = 1; (i) <= (int)(n); (i)++) printf("%d ", vis[i]);
  puts("");
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
