#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
#include<vector>
#include<cstring>
#include<string>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<climits>
#include<iomanip>
#include<cassert>
using namespace std;
typedef long long LL;
#define N 210000
#define mod 1000000007
#define PI acos(-1)
const int INF=INT_MAX;
string ch;
int f(int x)
{
    int k=0;
    for(int i=0;i<ch.size();i++)
    {
        k=(k*10+ch[i]-'0')%x;
    }
    if(k) return 0;
    else return 1;
}
int main()
{
    while(cin>>ch)
    {
        if(f(2)||f(3)||f(5)) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
    return 0;
}