#include <atcoder/all>
#include <bits/stdc++.h>
using ll = long long;
using ull = unsigned long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
using namespace std;
using namespace atcoder;
using mint = modint998244353;
const int inf = 1000000007;
const ll longinf = 1ll << 60;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    bitset<262144> dp1, dp2;
    int m = 131072;
    dp1[m] = dp2[m] = 1;
    REP(i, 1, n + 1) {
        if(i % 2) {
            dp1 = (dp1 << i) | (dp1 >> i);
        } else {
            dp2 = (dp2 << i) | (dp2 >> i);
        }
    }
    if(dp1[m] && dp2[m]) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
    return 0;
}