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

struct lol{
int x,y;};
lol a[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].x;
        if (i<=n) sum+=a[i].x;
        a[i].y=i;
    }
    while (sum%n)
    {
        x=rand()%n;x++;
        y=rand()%(n-1);y+=n+1;
        swap(a[x],a[y]);
        sum+=a[x].x-a[y].x;
    }
    for (i=1;i<=n;i++)cout<<a[i].y<<" ";
    return 0;
}