Миша и криптография

#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <cmath>
#include <math.h>
#include <queue>
#include <stack>
#include <climits>
#include <deque>
#include <ctime>
#include <iterator>

using namespace std;
const int INF = (int)(2e9);

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;

#define mh() make_heap()
#define poph() pop_heap()
#define pushh() push_heap()
#define sor(n) n.begin(), n.end()
#define mp make_pair


#define files freopen("secretroom.in", "rt", stdin); freopen("secretroom.out", "wt", stdout)

int findpt(ll b)
{
    ll answ = 0;
    ll o = b;
    ll i = 2;
    while (i <= 1e8)
    {
        if (o == 1)
            break;
        if (o%i == 0)
        {
            answ++;
            o /= i;
        }
        else
            i++;
    }
    if (o > 1)
        answ++;
    return answ;
}
int main()
{
    ll b;
    cin >> b;
    ll u = findpt(b);
    cout << (u==20? "YES" : "NO");
    system("pause");
    return 0;
}