#include <fstream>
#include <algorithm>

using namespace std;

const int MAXN = 650000;

int n, a [ MAXN ], idx [ MAXN ];

int main()
{
    int i, s;
    ifstream f ( "congr.in" );
    f >> n;
    for ( i = 0; i < 2 * n - 1; ++ i ){
        f >> a [ i ];
        a [ i ] = a [ i ] % n;
        idx [ i ] = i;
    }
    for ( ; ; ){
        s = 0;
        random_shuffle ( idx, idx + 2 * n - 1 );
        for ( i = 0; i < n; ++ i ){
            s += a [ idx [ i ] ];
            if ( s >= n )   s -= n;
        }
        if ( s == 0 ){
            ofstream g ( "congr.out" );
            for ( i = 0; i < n; ++ i )
                g << idx [ i ] << ' ';
            g << '\n';
            g . close ();
            return 0;
        }
    }
    return 0;
}