var f,g:text;
    n,i,k:byte;
    x:array[1..8] of byte;
    ok:boolean;

procedure citire;
  begin
    assign(f,'permutari.in');
    reset(f);
    readln(f,n);
    assign(g,'permutari.out');
    rewrite(g);
  end;

function posibil(k:byte):boolean;
  begin
    posibil:=true;
    for i:=1 to k-1 do if x[i]=x[k] then posibil:=false;
  end;

procedure sol;
  begin
    for i:=1 to n do write(g,x[i],' ');
    writeln(g);
  end;

procedure back;
  begin
    k:=1;
    while k>0 do begin
      ok:=false;
      while not ok and (x[k]<n) do begin
        x[k]:=x[k]+1;
        ok:=posibil(k);
      end;
      if ok then if k=n then sol
                 else begin
                   k:=k+1;
                   x[k]:=0;
                 end
      else k:=k-1;
    end;
    close(g);
  end;

begin
  citire;
  back;
end.