var a:array[1..100] of longint;
st:array[1..100] of longint;
i,n,k,j:longint;
ok:boolean;
begin
assign(input,'permutari.in');reset(input);
assign(output,'permutari.out');rewrite(output);
read(n);
for i:=1 to n do
a[i]:=i;
k:=1;
st[k]:=0;
while k>0 do begin
if st[k]<n then begin
st[k]:=st[k]+1;
ok:=true;
for j:=1 to k-1 do
if st[k]=st[j] then
ok:=false;
if ok=true then begin
if k=n then begin
for i:=1 to n do
write(a[st[i]],' ');
writeln;
end;
if k<n then begin
k:=k+1;
st[k]:=0;
end;
end;
end;
if st[k]=n then
dec(k);
end;
close(output);
end.