#include <bits/stdc++.h>
const int inf = 0x3f3f3f3f, Inf = 0x7fffffff;
const long long INF = 0x7ffffffffffffff;
const double eps = 1e-8;
unsigned int seed = 19260817;
__inline__ __attribute__((always_inline)) unsigned int Rand() {
  return seed = seed * 998244353u + 1000000007u;
}
template <typename _Tp>
_Tp gcd(const _Tp &a, const _Tp &b) {
  return (!b) ? a : gcd(b, a % b);
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) _Tp abs(const _Tp &a) {
  return a > 0 ? a : -a;
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) _Tp max(const _Tp &a, const _Tp &b) {
  return a < b ? b : a;
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) _Tp min(const _Tp &a, const _Tp &b) {
  return a < b ? a : b;
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) void chmax(_Tp &a, const _Tp &b) {
  (a < b) && (a = b);
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) void chmin(_Tp &a, const _Tp &b) {
  (a > b) && (a = b);
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) bool _cmp(const double &a,
                                                    const double &b) {
  return abs(a - b) <= eps;
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) void read(_Tp &x) {
  register char ch(getchar());
  bool f(false);
  while (ch < 48 || ch > 57) f |= ch == 45, ch = getchar();
  x = ch & 15, ch = getchar();
  while (ch >= 48 && ch <= 57)
    x = (((x << 2) + x) << 1) + (ch & 15), ch = getchar();
  if (f) x = -x;
}
template <typename _Tp, typename... Args>
__inline__ __attribute__((always_inline)) void read(_Tp &t, Args &...args) {
  read(t);
  read(args...);
}
__inline__ __attribute__((always_inline)) int read_str(char *s) {
  register char ch(getchar());
  while (ch < 65 || ch > 122 || (ch > 90 && ch < 97)) ch = getchar();
  register char *tar = s;
  *tar = ch, ch = getchar();
  while ((ch >= 65 && ch <= 90) || (ch >= 97 && ch <= 122))
    *(++tar) = ch, ch = getchar();
  return tar - s + 1;
}
const int N = 200005;
int a[N];
int f[N][2];
void print(int i, int opt) {
  if (!opt) {
    if (a[i] > f[i - 1][1] && f[i][0] == a[i - 1]) {
      print(i - 1, 1);
    } else if (a[i] > a[i - 1] && f[i][0] == f[i - 1][0]) {
      print(i - 1, 0);
    }
  } else {
    if (a[i] < f[i - 1][0] && f[i][1] == a[i - 1]) {
      print(i - 1, 0);
    } else if (a[i] < a[i - 1] && f[i][1] == f[i - 1][1]) {
      print(i - 1, 1);
    }
  }
  printf("%d ", opt);
}
int main() {
  int n;
  read(n);
  for (int i = 1; i <= n; ++i) read(a[i]);
  f[1][0] = inf;
  f[1][1] = -inf;
  for (int i = 2; i <= n; ++i) {
    f[i][0] = -inf;
    f[i][1] = inf;
    if (a[i] > f[i - 1][1]) {
      chmax(f[i][0], a[i - 1]);
    }
    if (a[i] > a[i - 1]) {
      chmax(f[i][0], f[i - 1][0]);
    }
    if (a[i] < f[i - 1][0]) {
      chmin(f[i][1], a[i - 1]);
    }
    if (a[i] < a[i - 1]) {
      chmin(f[i][1], f[i - 1][1]);
    }
  }
  if (f[n][0] <= -inf && f[n][1] >= inf) {
    printf("NO\n");
  } else {
    printf("YES\n");
    if (f[n][0] > -inf) {
      print(n, 0);
    } else {
      print(n, 1);
    }
    printf("\n");
  }
  return 0;
}
