[题目](https://vjudge.net/contest/357311#problem/G)

#include<iostream>
using namespace std;
const	int N=500000;
int s[N];
bool b[N];
void init()
{
   
	for(int j=1;j<=N;j++) //这种筛法复杂度nlogn
	for(int i=j+j;i<=N;i+=j)
		s[i]+=j;
		for(int j=1;j<=N;j++) 
		if(s[j]&&s[j]<=1000)
		b[s[j]]=1; 		

}
int main()
{
   
	init();
	int t;
	cin>>t;
	while(t--)
	{
   
		int n;
		cin>>n;
		if(b[n]==1)
		cout<<"no"<<endl;
		else
		cout<<"yes"<<endl;
		
	}
	return 0;	
}