#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long int;

int main() {
  ll N;
  cin >> N;
  ll ans = 0;
  ll n2 = N * 2;
  ll k = 1;
  ll kr = pow(N, 0.5);
  while (n2 - k > 0) {
    if (N % k == 0) {
      if (k == N / k) {
	n2 -= k;
	ans += k;
      } else {
	n2 -= k + N / k;
	ans += k + N / k;
      }
    }
    k++;
    if (N % kr == 0) {
      if (kr == N / kr) {
	n2 -= kr;
	ans += kr;
      } else {
	n2 -= kr + N / kr;
	ans += kr + N / kr;
      }
    }
    kr--;
  }
  if (ans == N * 2)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}