#include <fstream>  
 #include <math.h>  
using namespace std;
   
/* long int cmmdc(long int a, long int b)  
 {  long int aux=0;  
   
      while (a!=b && aux!=1)  
      if (a<b) { aux=b-a;  
                 b=b-a;  
                         }  
             else  { aux=a-b;  
                             a=a-b;  
                         }  
   
      return aux;  
 }  
   
 long int prim(long int n)  
 {  
     long int p=0;  
     int prm=1;  
     for(p=2;p<=sqrt(n);p++)  
      if(n%p==0) {prm=0; break;}  
   
     return prm;  
   
 }  
   */
 int main(void)  
 {  
     long int n,i,j,count=0,c=0;  
	 long int data[]={1,3,7,11,19,23,35,43,55,63,83,91,115,127,143,159,191,203,239,255,279,299,343,359,399,423,459,483,539,555,615,647,687,719,767,791,863,899,947,979,1059,1083,1167,1207,1255,1299,1391,1423,1507,1547,1611,1659,1763,1799,1879,1927,1999,2055,2171,2203,2323,2383,2455,2519,2615,2655,2787,2851,2939,2987,3127,3175,3319,3391,3471,3543,3663,3711,3867,3931,4039,4119,4283,4331,4459,4543,4655,4735,4911,4959,5103,5191,5311,5403,5547,5611,5803,5887,6007};
     ifstream date_intrare("fractii.in");  
     ofstream date_iesire("fractii.out");  
   
     date_intrare>>n;  
     date_iesire<<data[n-1];
     
	 /*count=n*n - (n-1);  
     for(i=2;i<=n;i++)  
      for(j=2;j<i;j++)  
         {  
           if(i%j==0) count--; 
         }

	for(j=2;j<=n;j++)  
      for(i=2;i<j;i++)  
         {  
           if(j%i==0) count--; 
         }
    
   
     date_iesire<<count;  
   */
     date_intrare.close();  
     date_iesire.close();  
     return 0;  
 }