var a,v:array[0..300000] of longint;
    van:array[1..300000] of boolean;
    n,i,p,s:longint;
    f:text;
    kilep:boolean;
procedure kiir(k:longint);
var i:longint;
begin
        if s mod p=0 then begin
                for i:=1 to k do write(f,v[i],' ');
                kilep:=true;
        end;
end;
procedure back(k:longint);
var i:longint;
begin
       if not kilep then
       for i:=v[k-1]+1 to n do
                if (not van[i]) then begin
                        v[k]:=i;
                        van[i]:=true;
                        s:=s+a[i];
                        if k=p then kiir(k)
                               else back(k+1);
                        s:=s-a[i];
                        van[i]:=false;
                end;
end;
begin
        assign(f,'congr.in'); reset(f);
        readln(f,p);
        n:=2*p-1;
        for i:=1 to n do read(f,a[i]);
        close(f);
        kilep:=false;
        assign(f,'congr.out'); rewrite(f);
        back(1);
        close(f);
end.