program PerestanovkiRecursion;
	  type Pere=array [byte] of integer;
	  var N,i,j:integer;
	      X:Pere;
	  procedure Generate(k:integer);
	    var i,j:byte;
	    procedure Swap(var a,b:integer);
	      var c:integer;
	    begin c:=a;a:=b;b:=c end;
	  begin
	    if k=N then
	      begin for i:= 1  to N do write(X[i]);writeln end
	    else
	      for j:=k+ 1  to N do
		begin
{      writeln('X[k+1] = ',X[k+ 1 ],' k+1=',k+ 1 );
      writeln('X[j] = ',X[j],' j=',j);
      readln;
 }
 	  Swap(X[k+ 1 ],X[j]);
	   Generate(k+ 1 );
		  Swap(X[k+ 1 ],X[j])
		end
	  end;
	begin
	  write('N=');readln(N);
    X[ 1 ]:= 1 ;X[ 2 ]:= 0 ; X[ 3 ]:= 0 ;x[ 4 ]:= 0 ;
	  { for i:= 1  to N do X[i]:=i;}
	  Generate( 0 );
    readln;
	end.