#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	a += b;
	if(a>MOD){
		a -= MOD;
	}
}

int n;
bool done[1<<10],memo[1<<10];

bool solve(int p){
	int i;
	if(done[p]){
		return memo[p];
	}
	done[p] = true;
	if(!p){
		memo[p] = ((n%2)?false:true);
		return memo[p];
	}
	for(i=1; i<4; ++i){
		if(p-i<0){
			continue;
		}
		if(!solve(p-i)){
			memo[p] = true;
			break;
		}
	}
	return memo[p];
}

int main(void){
	cin >> n;
	cout << ((solve(n)?"Yes":"No")) << endl;
	return 0;
}