Problem: Alexey recently held a programming contest for students from Berland. n students participated in a contest, i-th of them solved ai problems. Now he wants to award some contestants. Alexey can award the students with diplomas of three different degrees. Each student either will receive one diploma of some degree, or won't receive any diplomas at all. Let cntx be the number of students that are awarded with diplomas of degree x (1 ≤ x ≤ 3). The following conditions must hold:

  * For each x (1 ≤ x ≤ 3) cntx > 0; 
  * For any two degrees x and y cntx ≤ 2·cnty. 



Of course, there are a lot of ways to distribute the diplomas. Let bi be the degree of diploma i-th student will receive (or  - 1 if i-th student won't receive any diplomas). Also for any x such that 1 ≤ x ≤ 3 let cx be the maximum number of problems solved by a student that receives a diploma of degree x, and dx be the minimum number of problems solved by a student that receives a diploma of degree x. Alexey wants to distribute the diplomas in such a way that:

  1. If student i solved more problems than student j, then he has to be awarded not worse than student j (it's impossible that student j receives a diploma and i doesn't receive any, and also it's impossible that both of them receive a diploma, but bj < bi); 
  2. d1 - c2 is maximum possible; 
  3. Among all ways that maximize the previous expression, d2 - c3 is maximum possible; 
  4. Among all ways that correspond to the two previous conditions, d3 - c - 1 is maximum possible, where c - 1 is the maximum number of problems solved by a student that doesn't receive any diploma (or 0 if each student is awarded with some diploma). 



Help Alexey to find a way to award the contestants!

Input

The first line contains one integer number n (3 ≤ n ≤ 3000).

The second line contains n integer numbers a1, a2, ..., an (1 ≤ ai ≤ 5000).

Output

Output n numbers. i-th number must be equal to the degree of diploma i-th contestant will receive (or  - 1 if he doesn't receive any diploma).

If there are multiple optimal solutions, print any of them. It is guaranteed that the answer always exists.

Examples

Input

4
1 2 3 4


Output

3 3 2 1 


Input

6
1 4 3 1 1 2


Output

-1 1 2 -1 -1 3 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 3005;
const int MOD = 1000000007;
const double eps = 1e-8;
const double PI = acos(-1.0);
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n, long long p = MOD) {
  long long r = 1 % p;
  for (a %= p; n; a = a * a % p, n >>= 1)
    if (n & 1) r = r * a % p;
  return r;
}
long long inv(long long x, long long p = MOD) {
  return x <= 1 ? 1 : inv(p % x, p) * (p - p / x) % p;
}
struct node {
  int val, id;
} a[3005];
int da[3005];
bool cmpa(node a, node b) { return a.val > b.val; }
bool cmpb(node a, node b) { return a.id < b.id; }
struct RMQ {
  int f[MAXN][21], pos[MAXN][21];
  int n;
  void init(int a[], int sz) {
    n = sz;
    for (int i = 0; i < n; i++) {
      f[i][0] = a[i];
      pos[i][0] = i;
    }
    for (int j = 1; (1 << j) <= n; j++) {
      for (int i = 0; i + (1 << j) - 1 < n; i++) {
        if (f[i][j - 1] < f[i + (1 << (j - 1))][j - 1]) {
          f[i][j] = f[i + (1 << (j - 1))][j - 1];
          pos[i][j] = pos[i + (1 << (j - 1))][j - 1];
        } else {
          f[i][j] = f[i][j - 1];
          pos[i][j] = pos[i][j - 1];
        }
      }
    }
  }
  int query(int l, int r) {
    int k = 0;
    while ((1 << (k + 1)) <= r - l + 1) {
      k++;
    }
    return f[l][k] >= f[r - (1 << k) + 1][k] ? pos[l][k]
                                             : pos[r - (1 << k) + 1][k];
  }
} myRMQ;
int ans[4];
inline void update(int i, int j, int k) { ans[1] = i, ans[2] = j, ans[3] = k; }
inline bool check(int i, int j, int k) {
  if (da[i] > da[ans[1]]) {
    return 1;
  } else if (da[i] == da[ans[1]]) {
    if (da[j] > da[ans[2]]) {
      return 1;
    } else if (da[j] == da[ans[2]] && da[k] > da[ans[3]]) {
      return 1;
    }
  }
  return 0;
}
int main(int argc, char* argv[]) {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i].val);
    a[i].id = i;
  }
  sort(a + 1, a + n + 1, cmpa);
  for (int i = 1; i <= n; i++) {
    da[i] = a[i].val - a[i + 1].val;
  }
  myRMQ.init(da, n + 1);
  for (int i = 1; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      int cnt[4];
      cnt[1] = i, cnt[2] = j - i;
      if (cnt[1] > 2 * cnt[2] || cnt[2] > 2 * cnt[1] ||
          min(cnt[1], cnt[2]) > 2 * (n - j)) {
        continue;
      }
      int l = j + (max(cnt[1], cnt[2]) + 1) / 2,
          r = j + 2 * min(cnt[1], cnt[2]);
      l = max(l, j + 1), r = min(n, r);
      if (l > r) {
        continue;
      }
      int k = myRMQ.query(l, r);
      if (ans[1] == 0 || check(i, j, k)) {
        update(i, j, k);
      }
    }
  }
  for (int i = 1; i <= ans[1]; i++) {
    a[i].val = 1;
  }
  for (int i = ans[1] + 1; i <= ans[2]; i++) {
    a[i].val = 2;
  }
  for (int i = ans[2] + 1; i <= ans[3]; i++) {
    a[i].val = 3;
  }
  for (int i = ans[3] + 1; i <= n; i++) {
    a[i].val = -1;
  }
  sort(a + 1, a + n + 1, cmpb);
  for (int i = 1; i <= n; i++) {
    printf("%d ", a[i].val);
  }
  return 0;
}