program peerd;
var f,g:text;
   n,i:integer;
   x:array[1..10] of integer;
function cont(k:integer):boolean;
  begin
  cont:=true;
    for i:=1 to k-1 do
      if x[i]=x[k] then
       cont:=false;
  end;
procedure bkt;
var k:integer;
  begin
  k:=1;
  x[k]:=0;
    while k>0 do
      if x[k]<n then
        begin
          x[k]:=x[k]+1;
            if cont(k) then
              if k=n then
                begin
                  for i:=1 to n do
                    write(g,x[i],' ');
                  writeln(g);
                end
                else
                begin
                k:=k+1;
                x[k]:=0;
                end;
        end
        else
        k:=k-1;
  end;
begin
assign(f,'permutari.in'); reset(f);
assign(g,'permutari.out'); rewrite(g);
readln(f,n);
   bkt;
close(f);
close(g);
end.