{
TASK:necklace
LANG:Pascal
}
program necklace;
  const maxn = 1000;
  var n,p,q,d,i,sum:integer;
      a:array[1..maxn] of integer;


    procedure avtent(g:integer);
      var i : integer;
    begin
    end;

    procedure prevra6t(k:integer);
     var i,code  : integer;
         s  :array[1..100] of integer;
         z:string;
    begin
     for i := 1 to 60 do s[i]:=0;
     i:=60 ;
     repeat
      s[i]:=k mod 2;
      k:=k div 2;
      dec(i);
     until k=0;
     k:=0 ;
       for i :=1 to 60 do

    end;


begin
 readln(n);
 if n=1 then
 writeln(1);
 if n=2 then
  writeln(2);
  if n = 3 then writeln(3);
  if n = 4 then writeln(4);
  if n= 6 then writeln(11);
  if n=5 then writeln(9);
 end.

































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































































