#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n, arr[N], ans[N];
vector<pair<int, int> > v;
pair<int, int> seg[4 * N];
pair<int, int> build(int s, int e, int idx) {
  if (s == e)
    return seg[idx] = make_pair(v[s].first - (s == 0 ? 0 : v[s - 1].first), s);
  return seg[idx] = max(build(s, (s + e) / 2, idx * 2),
                        build((s + e) / 2 + 1, e, idx * 2 + 1));
}
pair<int, int> getmax(int s, int e, int idx, int l, int r) {
  if (s > r || e < l) return make_pair(-1234, 0);
  if (s >= l && e <= r) return seg[idx];
  return max(getmax(s, (s + e) / 2, idx * 2, l, r),
             getmax((s + e) / 2 + 1, e, idx * 2 + 1, l, r));
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &arr[i]);
    v.push_back(make_pair(arr[i], i));
  }
  sort(v.begin(), v.end());
  build(0, n - 1, 1);
  int mx = 0;
  int mx2 = 0;
  for (int i = 1; i < n; i++) {
    for (int j = 1; j < n; j++) {
      int k = (max(i, j) + 1) / 2;
      if (k > (n - (i + j))) k = n - (i + j);
      if (k * 2 < j || k * 2 < i) continue;
      if (i * 2 < j || i * 2 < k) continue;
      if (j * 2 < i || j * 2 < k) continue;
      mx = max(mx, v[n - i].first - v[n - i - 1].first);
    }
  }
  for (int i = 1; i < n; i++) {
    for (int j = 1; j < n; j++) {
      int k = (max(i, j) + 1) / 2;
      if (k > (n - (i + j))) k = n - (i + j);
      if (k * 2 < j || k * 2 < i) continue;
      if (i * 2 < j || i * 2 < k) continue;
      if (j * 2 < i || j * 2 < k) continue;
      int cur = v[n - i].first - v[n - i - 1].first;
      if (cur != mx) continue;
      mx2 = max(mx2, v[n - i - j].first - v[n - i - j - 1].first);
    }
  }
  int idx1 = 0, idx2 = 0, idx3 = 0;
  int mx3 = -1;
  for (int i = 1; i < n; i++) {
    for (int j = 1; j < n; j++) {
      int k = (max(i, j) + 1) / 2;
      if (k > (n - (i + j))) k = n - (i + j);
      if (k * 2 < j || k * 2 < i) continue;
      if (i * 2 < j || i * 2 < k) continue;
      if (j * 2 < i || j * 2 < k) continue;
      int cur = v[n - i].first - v[n - i - 1].first;
      if (cur != mx) continue;
      int cur2 = (v[n - i - j].first - v[n - i - j - 1].first);
      if (cur2 != mx2) continue;
      int mnk = (max(i, j) + 1) / 2;
      int mxk = min(i, j) * 2;
      if (mxk > (n - (i + j))) mxk = (n - (i + j));
      pair<int, int> cur3 =
          getmax(0, n - 1, 1, n - i - j - mxk, n - i - j - mnk);
      if (cur3.first > mx3) {
        mx3 = cur3.first;
        idx1 = i;
        idx2 = j;
        idx3 = cur3.second;
      }
    }
  }
  for (int i = 0; i < idx1; i++) {
    ans[v.back().second] = 1;
    v.pop_back();
  }
  for (int i = 0; i < idx2; i++) {
    ans[v.back().second] = 2;
    v.pop_back();
  }
  for (int i = 0; i < idx3; i++) ans[v[i].second] = -1;
  for (int i = idx3; i < v.size(); i++) ans[v[i].second] = 3;
  for (int i = 0; i < n; i++) printf("%d ", ans[i]);
  puts("");
  return 0;
}
