#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
template <class T, class U>
inline void add_self(T &a, U b) {
  a += b;
  if (a >= mod) a -= mod;
  if (a < 0) a += mod;
}
template <class T, class U>
inline void min_self(T &x, U y) {
  if (y < x) x = y;
}
template <class T, class U>
inline void max_self(T &x, U y) {
  if (y > x) x = y;
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  cout << t;
  ;
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
template <class T, class U>
void print_m(const map<T, U> &m, int w = 3) {
  if (m.empty()) {
    cout << "Empty" << endl;
    return;
  }
  for (auto x : m) cout << "(" << x.first << ": " << x.second << ")," << endl;
  cout << endl;
}
template <class T, class U>
void debp(const pair<T, U> &pr, bool end_line = 1) {
  cout << "{" << pr.first << " " << pr.second << "}";
  cout << (end_line ? "\n" : ", ");
}
template <class T>
void print_vp(const T &vp, int sep_line = 0) {
  if (vp.empty()) {
    cout << "Empty" << endl;
    return;
  }
  if (!sep_line) cout << "{ ";
  for (auto x : vp) debp(x, sep_line);
  if (!sep_line) cout << "}\n";
  cout << endl;
}
template <typename T>
void print(const T &v, bool show_index = false) {
  int w = 2;
  if (show_index) {
    for (int i = 0; i < int((v).size()); i++) cout << setw(w) << i << " ";
    cout << endl;
  }
  for (auto &el : v) cout << setw(w) << el << " ";
  cout << endl;
}
template <typename T>
void print_vv(const T &vv) {
  if (int((vv).size()) == 0) {
    cout << "Empty" << endl;
    return;
  }
  int w = 3;
  cout << setw(w) << " ";
  for (int j = 0; j < int((*vv.begin()).size()); j++)
    cout << setw(w) << j << " ";
  cout << endl;
  int i = 0;
  for (auto &v : vv) {
    cout << i++ << " {";
    for (auto &el : v) cout << setw(w) << el << " ";
    cout << "},\n";
  }
  cout << endl;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  while (cin >> n) {
    vector<int> a(n);
    for (int i = 0; i < int(n); i++) cin >> a[i];
    vector<vector<int>> dp(n, vector<int>(5));
    for (int f = 0; f < int(5); f++) dp[0][f] = 1;
    for (int i = int(1); i < int(n); i++) {
      if (a[i - 1] < a[i]) {
        for (int pf = 0; pf < int(5); pf++) {
          for (int cf = int(pf + 1); cf < int(5); cf++)
            dp[i][cf] |= dp[i - 1][pf];
        }
      } else if (a[i - 1] > a[i]) {
        for (int pf = 0; pf < int(5); pf++) {
          for (int cf = int(0); cf < int(pf); cf++) dp[i][cf] |= dp[i - 1][pf];
        }
      } else {
        for (int pf = 0; pf < int(5); pf++)
          for (int cf = 0; cf < int(5); cf++) {
            if (pf != cf) {
              dp[i][cf] |= dp[i - 1][pf];
            }
          }
      }
    }
    int cf = -1;
    for (int f = 0; f < int(5); f++) {
      if (dp[n - 1][f]) {
        cf = f;
        break;
      }
    }
    if (cf == -1) {
      cout << -1 << "\n";
      continue;
    }
    vector<int> ans;
    ans.push_back(cf + 1);
    int row = n - 1;
    while (row) {
      if (a[row - 1] < a[row]) {
        for (int pf = 0; pf < int(cf); pf++) {
          if (dp[row - 1][pf]) {
            cf = pf;
            break;
          }
        }
      } else if (a[row - 1] > a[row]) {
        for (int pf = int(cf + 1); pf < int(5); pf++) {
          if (dp[row - 1][pf]) {
            cf = pf;
            break;
          }
        }
      } else {
        for (int pf = 0; pf < int(5); pf++) {
          if (pf != cf && dp[row - 1][pf]) {
            cf = pf;
            break;
          }
        }
      }
      ans.push_back(cf + 1);
      --row;
    }
    reverse(ans.begin(), ans.end());
    assert(int((ans).size()) == n);
    print(ans);
  }
  return 0;
}
