#include <bits/stdc++.h>
//#include <bits/extc++.h>
//using namespace __gnu_pbds;

//template<class T>
//using Tree= tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#pragma GCC optimize("O3")
//#define int long long

using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	int n; cin >> n;
	set<tuple<int, double, int>> st;
	st.insert({0, 0, n});
	vector<int> a(n);
	double sub = 1e9;
	for (int& v : a) cin >> v;
	for (int i = n - 1; i >= 0; --i) {
		auto [ln, vl, id] = *prev(st.lower_bound({a[i], -1e12, -1e12}));
		assert(ln + 1 == a[i]);
		st.insert({a[i], vl - sub, i});
		sub /= 3;
	}
	vector<int> res(n);
	vector<pair<double, int>> vals;
	for (auto [ln, vl, id] : st) if (id < n) vals.push_back({vl, id});
	sort(vals.begin(), vals.end());
	int i = 1;
	for (auto [x, p] : vals) res[p] = i++;
	for (int v : res) cout << v << ' '; cout << '\n';
}