Problem: Two integer sequences existed initially — one of them was strictly increasing, and the other one — strictly decreasing.

Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_k]. And strictly decreasing sequence is a sequence of integers [y_1 > y_2 > ... > y_l]. Note that the empty sequence and the sequence consisting of one element can be considered as increasing or decreasing.

They were merged into one sequence a. After that sequence a got shuffled. For example, some of the possible resulting sequences a for an increasing sequence [1, 3, 4] and a decreasing sequence [10, 4, 2] are sequences [1, 2, 3, 4, 4, 10] or [4, 2, 1, 10, 4, 3].

This shuffled sequence a is given in the input.

Your task is to find any two suitable initial sequences. One of them should be strictly increasing and the other one — strictly decreasing. Note that the empty sequence and the sequence consisting of one element can be considered as increasing or decreasing.

If there is a contradiction in the input and it is impossible to split the given sequence a to increasing and decreasing sequences, print "NO".

Input

The first line of the input contains one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the number of elements in a.

The second line of the input contains n integers a_1, a_2, ..., a_n (0 ≤ a_i ≤ 2 ⋅ 10^5), where a_i is the i-th element of a.

Output

If there is a contradiction in the input and it is impossible to split the given sequence a to increasing and decreasing sequences, print "NO" in the first line.

Otherwise print "YES" in the first line and any two suitable sequences. Note that the empty sequence and the sequence consisting of one element can be considered as increasing or decreasing.

In the second line print n_i — the number of elements in the strictly increasing sequence. n_i can be zero, in this case the increasing sequence is empty.

In the third line print n_i integers inc_1, inc_2, ..., inc_{n_i} in the increasing order of its values (inc_1 < inc_2 < ... < inc_{n_i}) — the strictly increasing sequence itself. You can keep this line empty if n_i = 0 (or just print the empty line).

In the fourth line print n_d — the number of elements in the strictly decreasing sequence. n_d can be zero, in this case the decreasing sequence is empty.

In the fifth line print n_d integers dec_1, dec_2, ..., dec_{n_d} in the decreasing order of its values (dec_1 > dec_2 > ... > dec_{n_d}) — the strictly decreasing sequence itself. You can keep this line empty if n_d = 0 (or just print the empty line).

n_i + n_d should be equal to n and the union of printed sequences should be a permutation of the given sequence (in case of "YES" answer).

Examples

Input


7
7 2 7 3 3 1 4


Output


YES
2
3 7 
5
7 4 3 2 1 


Input


5
4 3 1 5 3


Output


YES
1
3 
4
5 4 3 1 


Input


5
1 1 2 1 2


Output


NO


Input


5
0 1 2 3 4


Output


YES
0

5
4 3 2 1 0 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 9223372036854775807;
int MOD(int a, int b) {
  if (a > b)
    return a - b;
  else
    return b - a;
}
int max3(int a, int b, int c) { return max(c, max(a, b)); }
int min3(int a, int b, int c) { return min(a, min(b, c)); }
long long int power(long long int x, long long int y) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x) % 1000000007;
    y = y >> 1;
    x = (x * x) % 1000000007;
  }
  return res % 1000000007;
}
long long int logg(long long int a) {
  long long int x = 0;
  while (a > 1) {
    x++;
    a /= 2;
  }
  return x;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int abso(long long int x) {
  if (x < 0) {
    return -x;
  }
  return x;
}
long long int ceiling(long long int a, long long int b) {
  if (a % b == 0) {
    return a / b;
  } else {
    return a / b + 1;
  }
}
long long int modinv(long long int x) { return power(x, 1000000007 - 2); }
vector<pair<int, int>> tree;
vector<int> a;
vector<int> lis, lds;
vector<int> ans;
multiset<int> inc;
multiset<int> de;
void build(int node, int start, int end) {
  if (start == end) {
    tree[node] = make_pair(a[start], start);
  } else {
    int mid = (start + end) / 2;
    build(2 * node, start, mid);
    build(2 * node + 1, mid + 1, end);
    if (tree[2 * node + 1].first > tree[2 * node].first) {
      tree[node] = tree[2 * node + 1];
    } else {
      tree[node] = tree[2 * node];
    }
  }
}
pair<int, int> query(int node, int start, int end, int l, int r) {
  if (r < start or end < l) {
    return make_pair(-1, -1);
  }
  if (l <= start and end <= r) {
    return tree[node];
  }
  int mid = (start + end) / 2;
  pair<int, int> p1 = query(2 * node, start, mid, l, r);
  pair<int, int> p2 = query(2 * node + 1, mid + 1, end, l, r);
  if (p1.first > p2.first) {
    return p1;
  } else {
    return p2;
  }
}
bool solve(int i, int j, int n, int inc_min, int inc_max, int dec_min,
           int dec_max) {
  if (i > j) {
    return true;
  }
  pair<int, int> k = query(1, 0, n - 1, i, j);
  if (k.second + lds[k.second] - 1 >= j && i + lis[i] - 1 >= k.second) {
    if (a[j] <= dec_min) {
      if (k.second - 1 < i || a[k.second - 1] < a[j]) {
        for (int ind = k.second; ind <= j - 1; ind++) {
          if (a[ind] > dec_min && a[ind] < dec_max) {
            ans[ind] = 1;
            de.insert(a[ind]);
          } else {
            return false;
          }
        }
        for (int ind = i; ind < k.second; ind++) {
          if (a[ind] > inc_min && a[ind] < inc_max) {
            ans[ind] = 0;
            inc.insert(a[ind]);
          } else {
            return false;
          }
        }
        inc.insert(a[j]);
        return true;
      } else {
        return false;
      }
    }
    if (a[i] <= inc_min) {
      if (k.second + 1 > j || a[k.second + 1] < a[i]) {
        for (int ind = i + 1; ind <= k.second; ind++) {
          if (a[ind] > inc_min && a[ind] < inc_max) {
            ans[ind] = 0;
            inc.insert(a[ind]);
          } else {
            return false;
          }
        }
        for (int ind = k.second + 1; ind <= j; ind++) {
          if (a[ind] > dec_min && a[ind] < dec_max) {
            ans[ind] = 1;
            de.insert(a[ind]);
          } else {
            return false;
          }
        }
        de.insert(a[i]);
        return true;
      } else {
        return false;
      }
    }
    for (int ind = i; ind < k.second; ind++) {
      if (a[ind] > inc_min && a[ind] < inc_max) {
        ans[ind] = 0;
        inc.insert(a[ind]);
      } else {
        return false;
      }
    }
    for (int ind = k.second + 1; ind <= j; ind++) {
      if (a[ind] > dec_min && a[ind] < dec_max) {
        ans[ind] = 1;
        de.insert(a[ind]);
      } else {
        return false;
      }
    }
    if (k.first < dec_max && k.first > dec_min) {
      de.insert(k.first);
      ans[k.second] = 1;
      return true;
    }
    if (k.first < inc_max && k.first > inc_min) {
      inc.insert(k.first);
      ans[k.second] = 0;
      return true;
    }
  }
  if (k.second + lds[k.second] - 1 >= j && k.first > inc_min &&
      k.first < inc_max) {
    for (int ind = k.second + 1; ind <= j; ind++) {
      if (a[ind] < dec_max && a[ind] > dec_min) {
        de.insert(a[ind]);
        ans[ind] = 1;
      } else {
        return false;
      }
    }
    inc.insert(k.first);
    ans[k.second] = 0;
    int ch = dec_min;
    if (k.second + 1 <= j) {
      ch = max(ch, a[k.second + 1]);
    }
    return solve(i, k.second - 1, n, inc_min, k.first, ch, dec_max);
  }
  if (i + lis[i] - 1 >= k.second && k.first > dec_min && k.first < dec_max) {
    for (int ind = i; ind < k.second; ind++) {
      if (a[ind] < inc_max && a[ind] > inc_min) {
        inc.insert(ind);
        ans[ind] = 0;
      } else {
        return false;
      }
    }
    de.insert(k.first);
    ans[k.second] = 1;
    int ch = inc_min;
    if (k.second - 1 >= i) {
      ch = max(ch, a[k.second - 1]);
    }
    return solve(k.second + 1, j, n, ch, inc_max, dec_min, k.first);
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int n;
  cin >> n;
  a.resize(n);
  ans.resize(n);
  lis.resize(n);
  lds.resize(n);
  tree.resize(4 * n + 50);
  map<int, int> g;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    g[a[i]]++;
    if (g[a[i]] > 2) {
      cout << "NO";
      return 0;
    }
  }
  build(1, 0, n - 1);
  lds[n - 1] = lis[n - 1] = 1;
  for (int j = n - 2; j >= 0; j--) {
    if (a[j] < a[j + 1]) {
      lis[j] = 1 + lis[j + 1];
      lds[j] = 1;
    }
    if (a[j] > a[j + 1]) {
      lis[j] = 1;
      lds[j] = 1 + lds[j + 1];
    }
    if (a[j] == a[j + 1]) {
      lis[j] = lds[j] = 1;
    }
  }
  if (solve(0, n - 1, n, -power(10, 7), power(10, 7), -power(10, 7),
            power(10, 7))) {
    cout << "YES" << endl;
    for (int i = 0; i < n; i++) {
      cout << ans[i] << ' ';
    }
  } else {
    cout << "NO" << endl;
  }
}