var n,k:longint;
    st:array[1..10000] of longint;
    f,g:text;

function verif:boolean;
var i:longint;
begin
verif:=true;
for i:=1 to k-1 do
if st[i]=st[k] then verif:=false;
end;

procedure afisare;
var i:longint;
begin
for i:=1 to n do write(g,st[i],' ');
writeln(g);
end;

procedure back;
begin
k:=1;
st[k]:=0;
while k>0 do
        begin
        while st[k]<n do
                begin
                inc(st[k]);
                if verif then
                        if k=n then afisare
                else

                        begin
                         k:=k+1;
                         st[k]:=0;
                        end;
                end;
        k:=k-1;
        end;
end;

begin
assign(f,'permutari.in');
reset(f);
assign(g,'permutari.out');
rewrite(g);
read(f,n);
back;
close(f);
close(g);
end.