package chelper;

import java.util.HashSet;
import java.util.List;
import java.util.Set;

import io.InputReader;
import io.OutputWriter;
import misc.SimpleSavingChelperSolution;
import misc.Stuff;


public class CHEFPRMS extends SimpleSavingChelperSolution {

  public void solve(int testNumber, InputReader in, OutputWriter out) {
    wrapSolve(testNumber, in, out);
  }


  List<Integer> primes = Stuff.generatePrimes(1000);
  Set<Integer> semiprimes = new HashSet<>();
  Set<Integer> sums = new HashSet<>();

  {
    for (int i = 0; i < primes.size(); i++) {
      for (int j = i + 1; j < primes.size(); j++) {
        int sp = primes.get(i) * primes.get(j);
        if (sp < 1000) {
          semiprimes.add(sp);
        }
      }
    }

    for (int i : semiprimes) {
      for (int j : semiprimes) {
        sums.add(i + j);
      }
    }
  }

  @Override
  public void solve(int testNumber) {
    int n = in.nextInt();

    out.println(sums.contains(n) ? "YES" : "NO");
  }
}