#include <iostream>
#include <fstream>
#include <cstdlib>

using namespace std;

ifstream in ("congr.in");
ofstream out ("congr.out");

int V[600010], Sol[600010];

int main()
{
    int N, i, j, k;
    long long S = 0;

    in >> N;

    for (i = 1; i < 2 * N; i ++){
        in >> V[i];
        Sol[i] = i;

        if (i <= N)
            S += V[i];
    }

    while (S % N){
        j = 1 + rand () % N;
        k = N + 1 + rand () % (N - 1);

        S = S - V[j] + V[k];
        swap (Sol[j], Sol[k]);
        swap (V[j], V[k]);
    }

    for (i = 1; i <= N; i ++)
        out << Sol[i] << " ";

    return 0;
}