You need to find if a number can be expressed as sum of two perfect powers. That is, given x find if there exists non negative integers a, b, m, n such that a^m + b^n = x. 

Input
First line of the input contains number of test cases T. It is followed by T lines, each line contains a sinle number x.

Output
For each test case, print "Yes" (without quotes) if the number can be expressed as sum of two perfect powers. Otherwise print "No" (without quotes). 

Constraints
1 ≤ T ≤ 1000
1 ≤ x ≤ 1000000
m > 1, n > 1

SAMPLE INPUT
5
5
15
9
77
100

SAMPLE OUTPUT
Yes
No
Yes
No
Yes
a=[]
for i in range(1,1000):
    j=2;
    while(j<21):
        p=i**j;
        if(p>1000000):
            break
        a.append(p)
        j=j+1

tc=input()
while(tc):
    tc=tc-1
    x=input()
    d=0
    for i in range(0,len(a)):
        if x-a[i] in a:
            print "Yes"
            d=1
            break
    if d==0:
        print "No"