#include<algorithm>
using namespace std;
int n,i,x,r,s,in,sf;
int a[1010],ut[1010];
int main()
{
	freopen("congr.in","r",stdin);
	freopen("congr.out","w",stdout);
	scanf("%d",&n);
	for(i=1;i<=n+n-1;i++)
		scanf("%d",&a[i]);
	s=0;
	for(i=1;i<=n+n-1;i++)
	{
		s+=a[i];
		r=s%n;
		if(!r)
		{
			in=1;sf=i;
			if(sf-in+1==n)
				break;
		}
		else
			if(!ut[r])
				ut[r]=i;
			else
			{
				in=ut[r]+1;sf=i;
				if(sf-in+1==n)
				break;
			}
	}
	for(i=in;i<=sf;i++)
		printf("%d ",i);
	printf("\n");
	return 0;
}