#include <vector>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
const int N = 100010;

void solve()
{
    int x;
    cin>>x;
    int l = 0, r = 1e6;
    int ans = 0;
    while(l < r)
    {
        int mid = l + r >> 1;
        if(pow(mid, 3) < x)
            l = mid + 1;
        else
            r = mid;
    }
    if(pow(l, 3) == x)  ans = 1;

    cout<<ans<<endl;
}

int main()
{
    int t;
    cin>>t;
    while(t -- )solve();
    return 0;
}

最小0 最大1e6 直接遍历O(n) 或者二分