/* -*- coding: utf-8 -*-
 *
 * 2655.cc:  No.2655 Increasing Strides - yukicoder
 */

#include<cstdio>
#include<algorithm>

using namespace std;

/* constant */

/* typedef */

typedef long long ll;

/* global variables */

/* subroutines */

bool checkodd(int n) {
  // sig_i 2*i-1 = 2*(n*(n+1)/2)-n = n^2+n-n = n^2
  // n=2:  1,3 NG
  // n=4:  1,3,5,7 OK
  // n=6:  1,3,5,7,9,11 OK
  // n=8:  1,3,5,7,9,11,13,15 OK
  // n=10: 1,3,5,7,9,11,13,15,17,19 OK
  return (n > 2 && ! (n & 1));
}

bool checkeven(int n) {
  // sig_i 2*i = n(n+1)
  // n=3: 2,4,6 OK
  // n=4: 2,4,6,8 OK
  // n=5: 2,4,6,8,10 NG
  // n=6: 2,4,6,8,10,12 NG
  // n=7: 2,4,6,8,10,12,14 OK
  // n=8: 2,4,6,8,10,12,14,16 OK
  return (n > 2 && ((n & 3) == 3 || (n & 3) == 0));
}

/* main */

int main() {
  int n;
  scanf("%d", &n);

  int x = (n + 1) / 2, y = n / 2;

  if (checkodd(x) && checkeven(y)) puts("Yes");
  else puts("No");
  
  return 0;
}