/* Problem URL: https://codeforces.com/problemset/problem/1846/E2 */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n'; return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

const int oo = INT32_MAX >> 1;
const ll OO = INT64_MAX >> 1;

const int sz = 1e6 + 1;
vl p[sz];

void pre()
{
    for (__int128 i = 2; i < sz; i++) {
        __int128 cur = i * i;
        __int128 sum = i + i * i;

        while (sum <= (ll)1e18) {
            p[i].push_back(sum);
            cur *= i;
            sum += cur;
        }
    }
}

#define TEST 1

void solve()
{
    ll n;
    cin >> n;

    if (n == 1) {
        cout << "NO\n";
        return;
    }

    n--;

    __int128 at = sqrtl((n * 4 + 1)) / 2.0L - 0.5L;

    if (at > 1 && at + at * at  == n) {
        cout << "YES\n";
        return;
    }

    rep(i, 63) {
        int low = 2;
        int high = 1e6;
        int ans = 2;
        while (low <= high) {
            int mid = (low + high) >> 1;

            if (p[mid].size() > i && p[mid][i] <= n) {
                ans = mid;
                low = mid + 1;
                continue;
            }

            high = mid - 1;
        }

        if (p[ans].size() > i && p[ans][i] == n) {
            cout << "YES\n";
            return;
        }
    }

    cout << "NO\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    pre();

    int t;
    (TEST && cin >> t) || (t = 1);
    while (t--) {
        solve();
    }
}