Aimee

只要不能写成$2^N N subseteq N^*$就肯定有

 #include<iostream>
 #include<cstdio>
 #include<cmath>
 #define int long long
 using namespace std;
 int n,m;
 int prime[5000001];
 int flag[10000001];
 int Aimee[5000001];
 int p; 
 int num;
 int now;
 int t;
 long long x;
 signed main(){
     scanf("%d",&t);
     while(t--){
        int f=0;
        scanf("%lld",&x);
        while(x>1){
            if(x&1){
                cout<<"Yesn";
                f=1;
                break;
            }
            x>>=1;
        }
        if(!f){
            cout<<"Non";
        }
     }  
     return 0;
 }