#include<fstream>
#include<cstdlib>
#include<algorithm>
#include<cstdio>
#include<ctime>
#define ll long long
using namespace std;
FILE *f,*g;
int i,n,p1,p2,p[600010],a[600010];
ll s;
int main()
{
    f=fopen("congr.in","r");
    g=fopen("congr.out","w");
    fscanf(f,"%d",&n);
//    f>>n;
    for(i=1;i<2*n;++i)
    {
        fscanf(f,"%d",&a[i]);
//        f>>a[i];
        if(i<=n)
        {
            s+=(ll)a[i];
        }
        p[i]=i;
    }
    srand(time(NULL));
    while(s%n)
    {
        p1=rand()%n+1;
        p2=rand()%(n-1)+n+1;
        s=s-a[p1]+a[p2];
        swap(p[p1],p[p2]);
        swap(a[p1],a[p2]);
    }
    for(i=1;i<=n;++i)
    fprintf(g,"%d ",p[i]);
//    g<<p[i]<<' ';
    return 0;
}