#include<cstdio>
#include<algorithm>
#define infile "congr.in"
#define outfile "congr.out"
#define nmax 600013

using namespace std;

int v[nmax]; //sirul cu numerele
int r[nmax]; //r[i]=v[i]%p
int poz[nmax]; //poz[i]=pozitia din r al celui de-al i-lea element sortat
int p; //numarul de numere ce trebuie gasite
int n; //numarul total de numere

inline bool cmp(int i, int j)
{
	return (r[i]<r[j]);
}

void read()
{
	int i;
	scanf("%d\n",&p);
	n=(p<<1)-1;
	for(i=1;i<=n;++i)
		scanf("%d",&v[i]);
}

void init()
{
	int i;

	//initializam pe r
	for(i=1;i<=n;++i)
		r[i]=v[i]%p;

	//initializam pe poz
	for(i=1;i<=n;i++)
		poz[i]=i;

	//sortam pe r in functie de poz
	sort(poz+1, poz+1+n, cmp);

	/*
	for(i=1;i<=n;i++)
		printf("%d ",r[poz[i]]);
	printf("\n");
	*/
}

void solve()
{
}

void write()
{
	int i;
	for(i=1;i<=p;++i)
		printf("%d ",poz[i]);
	printf("\n");
}

int main()
{
	freopen(infile,"r",stdin);
	freopen(outfile,"w",stdout);

	read();
	init();
	solve();
	write();

	fclose(stdin);
	fclose(stdout);
	return 0;
}