Program vsechnyperm;

{ Program na utvoreni vsech permutaci rekurzivne }

const

  Max = 100;

type

  tpole = array[1..Max] of integer;

var
  n,i : integer;
  perm : tpole;
  use  : array[1..Max] of boolean;

procedure Gener(p : integer);
var
  i : integer;
begin
  if (p > n) then
  begin
    for i := 1 to n-1 do
      write(perm[i]:2,' ');
    writeln(perm[n]);
  end
  else
  begin
    for i:=1 to n do
    begin
      if not use[i] then
      begin
        use[i]:=true;
        perm[p]:=i;
        Gener(p+1);
        use[i]:=false;
      end;
    end;
  end;
end;

begin
  readln(n);

  for i:=1 to n do
    use[i]:=false;

  Gener(1);

end.
