#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
  ~debug() { cerr << endl; }
  template <class c>
  typename enable_if<sizeof dud<c>(0) != 1, debug&>::type operator<<(c i) {
    cerr << boolalpha << i;
    return *this;
  }
  template <class c>
  typename enable_if<sizeof dud<c>(0) == 1, debug&>::type operator<<(c i) {
    return *this << range(begin(i), end(i));
  }
  template <class c, class b>
  debug& operator<<(pair<b, c> d) {
    return *this << "(" << d.first << ", " << d.second << ")";
  }
  template <class c>
  debug& operator<<(rge<c> d) {
    *this << "[";
    for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it;
    return *this << "]";
  }
};
long double eps = (long double)1 / 1e6;
const long double pi = 3.14159265359;
long long inf = 2e9, mod1 = 1e9 + 7;
long long sqr(long long a) { return a * a; }
long long qb(long long a) { return a * a * a; }
template <typename T>
bool umax(T& a, T b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
bool umin(T& a, T b) {
  return b < a ? a = b, 1 : 0;
}
bool is_prime(long long val) {
  for (long long i = 2; i <= sqrt(val); i++)
    if (val % i == 0) return 0;
  return 1;
}
long long gcd(long long a, long long b) { return !a ? b : gcd(b % a, a); }
long long binpow(long long a, long long b, long long mod) {
  return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod
                    : sqr(binpow(a, b / 2, mod)) % mod)
           : 1;
}
long long binmult(long long a, long long b, long long mod) {
  return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod
                    : (2 * binmult(a, b / 2, mod)) % mod)
           : 0;
}
const long long R = 1e4;
const long long tx[4] = {0, 0, -1, 1};
const long long ty[4] = {-1, 1, 0, 0};
const char rev_to[4] = {'E', 'W', 'N', 'S'};
const int M = 999999937;
const int NM = 1 << 14;
const int N = 3002;
const int ppp = 73;
const int Y = 1;
const int X = 0;
auto rnd = bind(uniform_int_distribution<long long>(1, 125), mt19937(time(0)));
void bad() {
  cout << "-1";
  exit(0);
}
pair<int, int> lol[17][N];
signed main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);
  ;
  int n;
  cin >> n;
  vector<pair<int, int> > a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i].first;
    a[i].second = i;
  }
  sort(a.begin(), a.end());
  vector<int> b(n - 1);
  for (int i = 0; i + 1 < n; i++) {
    b[i] = a[i + 1].first - a[i].first;
    lol[0][i] = make_pair(b[i], i);
  }
  int m = (int)b.size();
  for (int i = 1; i < 17; i++) {
    for (int j = 0; j < m; j++) {
      lol[i][j] = max(lol[i - 1][j], lol[i - 1][(j + (1ll << i - 1)) % m]);
    }
  }
  vector<int> pows(N);
  for (int i = 2; i < N; i++) {
    pows[i] = pows[i >> 1] + 1;
  }
  auto get = [&](int l, int r) {
    if (r < 0) return make_pair(0, -1);
    int pl = l;
    umax(l, 0);
    umin(r, m - 1);
    umax(r, 0);
    int lvl = pows[r - l + 1];
    pair<int, int> ans = max(lol[lvl][l], lol[lvl][r - (1ll << lvl) + 1]);
    if (pl < 0) umax(ans, make_pair(a[0].first, -1));
    return ans;
  };
  int first = n, second = n, t = n;
  pair<int, pair<int, int> > aaa = make_pair(-1, make_pair(-1, -1));
  for (int i = 0; i < m; i++) {
    for (int j = i + 1; j < m; j++) {
      int cnt3 = m - j;
      int cnt2 = j - i;
      int lcnt1 = max(ceil((long double)cnt3 / 2), ceil((long double)cnt2 / 2));
      int rcnt1 = min(cnt3 * 2, cnt2 * 2);
      if (min(cnt2, cnt3) * 2 < max(cnt2, cnt3)) continue;
      if (lcnt1 > i + 1) continue;
      umax(lcnt1, 1);
      pair<int, int> heh = get(i - rcnt1, i - lcnt1);
      pair<int, pair<int, int> > kek = {b[j], {b[i], heh.first}};
      if (kek > aaa) {
        aaa = kek;
        first = heh.second;
        second = i;
        t = j;
      }
    }
  }
  vector<int> ans(n, -1);
  for (int i = 0; i < n; i++) {
    assert(a[i].second < n);
    if (i > t)
      ans[a[i].second] = 1;
    else if (i > second)
      ans[a[i].second] = 2;
    else if (i > first)
      ans[a[i].second] = 3;
    else
      ans[a[i].second] = -1;
  }
  for (auto& z : ans) cout << z << ' ';
  return 0;
}
