#include<bits/stdc++.h>

using namespace std;

constexpr int M = 1e9;
int average;

int n, a[101], vis[101];
unordered_map<int, bool> dp[101];

vector<int> stk;
void dfs(int u, int sum) {
    if (dp[u].count(sum)) return;
    if (sum == M) {
        for (int x : stk) cout << x + 1 << ' ';
        exit(0);
    }
    vector<pair<int, int>> b;
    for (int i = 0; i < n; i++) {
        if (vis[i]) continue;
        b.emplace_back(abs(a[i] - (average * u / n)), i);
    }
    sort(b.begin(), b.end());
    for (auto [x, i] : b) {
        vis[i] = 1;
        stk.push_back(i);
        dp[u][sum + a[i]] = 1;
        dfs(u + 1, sum + a[i]);
        stk.pop_back();
        vis[i] = 0;
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n;
    average = M / n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    dfs(1, 0);

    return 0;
}