#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <iomanip>
#include <bitset>
#include <cassert>
using namespace std;
typedef long long ll;

int mem[1003];
int n;

bool dfs(int res) {
	if (res <= 0) return n&1;
	if (mem[res] != 0) return mem[res] > 0;
	bool ret = false;
	for (int i = 1; i <= 3; i++) {
		ret |= !dfs(res - i);
	}
	return mem[res] = ret ? 1 : -1;
}

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