# include <algorithm>
using namespace std ;

const char FIN[] = "congr.in", FOU[] = "congr.out";
const int MAX = 600005;

# define x first
# define y second

pair < int, int > A[ MAX ] ;
int P ;

int main () {
    freopen ( FIN, "r", stdin ) ;
    freopen ( FOU, "w", stdout ) ;

    srand(time(0));

    scanf ( "%d", &P ) ;

    for (int i = 1; i < P << 1 ; ++i)
        scanf ( "%d", &A[i].x ) , A[i].y = i ;

    for ( bool stop = 1 ; stop ; random_shuffle ( A + 1, A + ( P << 1 ) ) ) {
        int S = 0;

        for (int i = 1; i <= P; ++i)
            S += A[i].x, S %= P ;

        if ( S % P == 0 ) {
            stop = 0 ;
            for (int i = 1; i <= P; ++i)
                printf ( "%d ", A[i].y ) ;
        }
    }


    return 0;
}