#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cassert>
#include <map>
#include <queue>
using namespace std;

int main(){
  int N;
  cin>>N;
  int one=(int)true;
  int two=one<<one;
  int three=two|one;
  int four=one<<two;
  int five=four|one;
  int seven=four|three;
  int eight=one<<three;
  int eleven=eight|three;
  int thirteen=eight|five;
  int sixteen=one<<four;
  int seventeen=sixteen|one;
  int nineteen=sixteen|three;
  int twentythree=sixteen|seven;
  int twentynine=sixteen|thirteen;
  int thirtyone=sixteen|eight|seven;

  vector<int> p;
  p.push_back(two);
  p.push_back(three);
  p.push_back(five);
  p.push_back(seven);
  p.push_back(eleven);
  p.push_back(thirteen);
  p.push_back(seventeen);
  p.push_back(nineteen);
  p.push_back(twentythree);
  p.push_back(twentynine);
  p.push_back(thirtyone);

  int zero=one&two;

  if(N==one){
    cout<<"NO"<<endl;
  }else{
    bool flag=true;
    for(auto x:p){
      if(N==x){
        cout<<"YES"<<endl;
        flag=false;
      }
    }
    if(flag){
      for(auto x:p){
        if(N%x==zero){
          flag=false;
        }
      }
      if(flag){
        cout<<"YES"<<endl;
      }else{
        cout<<"NO"<<endl;
      }
    }
  }
}