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

using Int  = int64_t;
using uInt = uint64_t;

template <typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using max_heap = priority_queue<T, vector<T>, less<T>>;

void solve( /* Copyright by Urtusea */ )
{
    Int n;
    cin >> n;

    Int sum = 0;
    for (int i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            sum += i;
            if (n / i != i) {
                sum += n / i;
            }
        }
    }

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

int main(int argc, char *argv[], char *envp[])
{
    cin.tie(nullptr)->sync_with_stdio(false);

    // for (int i = 1, n = (cin >> n, n); i <= n; i++)
        solve();

    return 0;
}