program divisor;
{$APPTYPE CONSOLE}


var prost:array[0..13] of integer=(2,3,5,7,11,13,17,19,23,29,31,37,41,43);
    divcnt:array[0..13] of longint;

var res,n:longint;
    f:text;

function Work:longint;
var nn:longint;
    i,j:longint;
begin
   if n=1 then begin Work:=1; Exit; end;
   for i:=0 to 13 do divcnt[i]:=0;
   for i:=2 to n do
       begin
       nn:=i;
       for j:=0 to 13 do
           while (nn mod prost[j]=0) do
              begin
              Inc(divcnt[j]);
              nn:=nn div prost[j];
              end;
       end;
   work:=1;
   for i:=0 to 13 do
     if divcnt[i]>0 then work:=work*(divcnt[i]+1);
end;

begin
   Assign(f,'divisor.dat');
   Reset(f);
   ReadLn(f,n);
   Close(f);
   res:=Work;
   Assign(f,'divisor.sol');
   ReWrite(f);
   WriteLn(f,res);
   Close(f);
end.