#include <stdio.h>
#include <time.h>

int TC;
int num,lo,hi;
int memo[10000001];
int prime[3163];
int primenb = -1;
int cnt,ea,temp,result;

int main(void)
{
time_t st = clock();

    // find prime num up to sqrt(10,000,000)
    for(int i=2;i<3163;i++) {
        cnt = 0;
        for(int j=2;j<=i;j++) {
            if(i%j == 0) cnt++;
            if(cnt==2) goto next1;
        }
        if(cnt == 1) {
            memo[i] = 2;
            prime[++primenb]=i;
        }
next1:;
    }
    memo[1] = 1;

    //scanf("%d",&TC);
    TC=1;
    for(int i=0;i<TC;i++)
    {
        //scanf("%d %d %d",&num,&lo,&hi);
        num = 200; lo = 1; hi = 10000000;
        // find divisor num
        for(int j=lo;j<=hi;j++)
        {
            if(memo[j] != 0)
                continue;
            temp = j;
            cnt = 1;

            for(int k=0;k<primenb;k++)
            {
                ea = 1;
                while(temp%prime[k]==0)
                {
                    temp = temp/prime[k];
                    ea++;
                }
                if(ea==1) continue;

                cnt = cnt*ea;
                if(temp == 1 || memo[temp] == 2) {
                    memo[j]=cnt*memo[temp];
                    goto next2;
                }
            }

            memo[temp] = 2;

            if(ea==1)
                memo[j]=cnt*memo[temp];
            else
                memo[j]=cnt;

    next2:;
        }

        for(int j=lo;j<=hi;j++)
        {
            if(memo[j] == num) result++;
        }
        printf("%d\n",result);

        result = 0;
    }
printf("time : %d\n",clock()-st);
    return 0;
}