// Template
#define FORESTED
#include "bits/stdc++.h"
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (ll i = (ll)(n) - 1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll INF = 3003003003003003003LL;
template <typename T>
inline bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T> 
inline bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
struct IOSET {
    IOSET() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    }
} ioset;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &element : vec) is >> element;
    return is;
}
template <typename T>
vector<T> operator--(vector<T> &vec) {
    for (T &element : vec) --element;
    return vec;
}

// Main
int main() {
    int a;
    cin >> a;
    for (int i = 1; i * i <= a; ++i) {
        if (a % i) continue;
        int j = a / i;
        if ((i % 2) && i >= 3) {
            cout << "YES\n";
            return 0;
        }
        if ((j % 2) && j >= 3) {
            cout << "YES\n";
            return 0;
        }
    }
    for (int i = 1; i * i <= 2 * a; ++i) {
        if (2 * a % i) continue;
        int j = 2 * a / i;
        if ((i % 2) && i >= 3) {
            cout << "YES\n";
            return 0;
        }
        if ((j % 2) && j >= 3) {
            cout << "YES\n";
            return 0;
        }
    }
    cout << "NO\n";
}