#include<fstream>
#include<ctime>
#include<cstdlib>
#include<algorithm>
using namespace std;
const int nmax=600007;


int  a[nmax],b[nmax];

long long sum;
int n,i,x,y;

int main()
{
    ifstream cin("congr.in");
    ofstream cout("congr.out");

    cin >> n;
    for (i=1;i<=2*n-1;i++)
    {
        cin>>a[i];
        if (i<=n) sum+=a[i];
        b[i]=i;
    }
    while (sum%n)
    {
        x=rand()%n;x++;
        y=rand()%(n-1);y+=n+1;
        swap(a[x],a[y]);
        swap(b[x],b[y]);
        sum+=a[x]-a[y];
    }
    for (i=1;i<=n;i++)cout<<b[i]<<" ";
    return 0;
}