#include<fstream>
#include<algorithm>
#include<cstdlib>
#include<ctime>
using namespace std;

int i,n,a[600005],rs[600005],gmb,fnc;
long long sum;

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

  cin>>n;
  for(i=1;i<n+n;++i)
  {
    cin>>a[i]; rs[i]=i;
    if(i<=n) sum+=a[i];
  }

  while(sum%n)
  {
    gmb=rand()%n+1;
    fnc=rand()%(n-1)+n+1;
    sum-=a[gmb]; sum+=a[fnc];
    swap(rs[gmb],rs[fnc]);
    swap(a[gmb],a[fnc]);
  }

  for(i=1;i<=n;++i) cout<<rs[i]<<' ';

 return 0;
}