#include <iostream>
#include <fstream>
#include <stdlib.h>

using namespace std;

const char iname[] = "congr.in";
const char oname[] = "congr.out";
const int nmax = 1000002;

ifstream fin(iname);
ofstream fout(oname);

long long P, A[nmax],  i, j, C[nmax], x, y, k, poz, oki;

void test()
{
	long long suma = 0;
	for(i = 1; i <= P; i ++)
		suma += A[C[i]];
	if(suma % P == 0)
	{
		oki = 1;
		for(i = 1; i <= P; i ++)
			fout << C[i] << " ";
		exit(0);
	}

}
void back(int k)
{	
	if(k - 1 == P)
		test();
	else
		for(int i = C[k - 1] + 1; i <= 2 * P - 1 - P + k; i ++)
		{
			C[k] = i;
			back(k + 1);
		}
}

int main()
{
	fin >> P;
	for(i = 1; i <= 2 * P - 1; i ++)
		fin >> A[i];
	back(1);		
	return 0;
}