#include<bits/stdc++.h>
using namespace std;
const int maxN=600005;

pair<int,int> v[maxN];

int p;
long long sum;

int main()
{
    freopen("congr.in","r",stdin);
    freopen("congr.out","w",stdout);


    scanf("%d",&p);
    for(int i=1;i<2*p;i++)
    {
        scanf("%d",&v[i].first);
        v[i].second=i;
        if(i<=p)
        {
            sum+=1LL*v[i].first;
        }
    }

    srand(time(0));

    while(sum%p)
    {
        int pos1=1+(rand()%p);
        int pos2=(p+1)+(rand()%(p-1));
        sum-=1LL*v[pos1].first;
        sum+=1LL*v[pos2].first;
        swap(v[pos1],v[pos2]);
    }

    for(int i=1;i<=p;i++)
        printf("%d ",v[i].second);
    printf("\n");

    return 0;
}