#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } else { return false; } }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } else { return false; } }
#define rep(i, s, n) for(int i = (s); i < n; i++) 
#define reps(i, s, n) for(int i = (s); i <= n; i++) 
#define rrep(i, n, s) for(int i = n; i >= (s); i--)
#define all(x) (x).begin(), (x).end()
#define print(V) for (int z = 0; z < (V).size(); z++) { cout << V[z] << " "; } cout << endl;
#define MOD 998244353
#define MOD2 1000000007
#define INF 1LL << 60
#define PI acos(-1)

ll enum_divisor(ll n) {
	ll res = 0;
	set<int> S;
	for (int i = 1; i * i <= n; i++) {
		if (n % i == 0) {
			auto it = S.find(i);
			if (it == S.end()) {
				res += i;
				S.insert(i);
			}

			it = S.find(n / i);
			if (it == S.end()) {
				res += n / i;
				S.insert(n / i);
			}
		}
	}

	return res;
}

int main(void) {
	ll n;
	cin >> n;

	if (enum_divisor(n) == 2 * n) {
		cout << "Yes" << endl;
	}
	else {
		cout << "No" << endl;
	}

	return 0;
}