#include<cstdio>

const int maxn = 300005;

using namespace std;

int i , j , k , p , v[2 * maxn] , cnt[maxn];

int main()
{
    freopen("congr.in","r",stdin);
    freopen("congr.out","w",stdout);

    scanf("%d",&p);
    k = p;

    for( i = 1 ; i <= 2 * p - 1 ; ++i) {
        scanf("%d",&v[i]) ,
        v[i] %= p ,
        cnt[v[i]]++;
        if ( cnt[v[i]] >= p ) {
            for( j = 1 ;  j <= 2 * p - 1 ; ++j )
                if ( v[j] == v[i] && k) k-- , printf("%d ",j);
            printf("\n");
            return 0;
            }
    }

    for()

return 0;
}