Sphenic numbers（素数筛）

Schoolboy Vasya is interested in the problem of distinguishing prime numbers. He has decided to develop his own testing method for it. Unfortunately, the new algorithm has one deficiency – it yields false positive outputs in case with so-called sphenic numbers. For those who does not know: sphenic number is the product of exactly three distinct prime numbers. Help Vasya write a program to distinguish sphenic numbers.

Inut

The input file contains a single number – integer n.

Limitations

30 ≤ n ≤ 10467397.

Output

The output file must contain one single line with the value “YES” (without quotation marks) if number n is sphenic or “NO” if it is not. Examples

Examples

Input.txt

30

40

10467397 

Output.txt

YES

NO

YES

#include <stdio.h>
#include <string.h>
#include <math.h>

#define maxx 10467397/6

int cur, prime[maxx+10];
int vis[maxx+10];
void find_prime()
{
    int i, j;
    memset(vis, 0, sizeof(vis));
    cur = 0;
    for(i=2; i<maxx; i++)
    {
        if(vis[i]==0)
        {
            prime[cur++] = i;
            for(j=1; j*i<=maxx; j++)
            {
                vis[j*i] = 1;
            }
        }

    }
}

int solve(int n)
{
    int num = 0, i;
    for(i=0; i<cur&&n>1; i++)
    {
        if(n % prime[i]==0)
        {
            num++;
            n/=prime[i];
        }
        if(n % prime[i]==0) break;
    }  
    if(num==3&&n==1&&!(i<cur&&n>1)) return 1;
    else return 0;
}

int main()
{
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    int n;
    find_prime();
    scanf("%d", &n);
    if(solve(n)) printf("YES
");
    else printf("NO
");
    return 0;
}