快速幂算法

#include <iostream>
long long fastpower(long long base,long long power){//快速幂 ：快速计算n的m次方 
	long long result=1;
	while(power){
		if(power&1){//power%2==1
			result*=base;
			base*=base;
		}
			power>>=1;//power=power/2
		
	}
	return result; 
} 
using namespace std;//注意写出来 
int main()
{
	long long t,i,base,n;
	int a;
	cin>>t;
	for(i=0;i<t;i++){
		cin>>n;
		a=0;
		for(int j=1;j<=64;j++){
			if(fastpower(2,j)==n){
				cout<<"NO"<<endl;
				a=1;
				break;
			}
		}
		if(a==0) cout<<"YES"<<endl;
	}
	return 0;
}