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

#include <iostream>
#include <vector>
#include <list>
#include <algorithm>

int main() {

  /* default begin */
  long i, j, k;
  long n, m;
  long temp;
  long t[16] = {};
  std::vector<long> v;
  bool b;
  /* default end */

  long N;
  long count = 0;

  std::cin >> N;

  switch(N) {
  case 0:
    return 0;  
  case 1:
    std::cout << "NO" << std::endl;
    return 0;
  case 2:
    std::cout << "NO" << std::endl;
    return 0;
  case 3:
    std::cout << "NO" << std::endl;
    return 0;
  case 4:
    std::cout << "NO" << std::endl;
    return 0;
  }
  
  b = false;

  t[0] = (long)sqrt((double)N)+1;

  i = 2;
  for(;;) {
    if( (N % i) == 0 ) {
      if( count >= 2 ) {
	b = true;
	goto label_1;
      }
      count++;
      N /= i;
    }
    else {
      break;
    }
  }

  for(i = 3; i <= t[0]; i+=2) {
    for(;;) {
      if( (N % i) == 0 ) {
	if( count >= 2 ) {
	  b = true;
	  goto label_1;
	}
	count++;
	N /= i;
      }
      else {
	break;
      }
    }
    if( N < i ) {
      break;
    }
  }
  if( N != 1 ) {
    if( count >= 2 ) {
      b = true;
    }
  }
  
 label_1:
  
  if( b ) {
    std::cout << "YES" << std::endl;
  }
  else {
    std::cout << "NO" << std::endl;
  }

  return 0;
}