#include<iostream>
using namespace std;
int flag = 0;
//算法核心
int f(int a[], int n, int b)
{
int mid;
int be = 0;
int en = n - 1;
while(be<=en)
{
for (int i = 0; i < n; i++)
{
mid = (be + en) / 2;
if (a[mid] == b)
{
return 1;
}
if (a[mid] > b)
en = mid - 1;
else
be = mid + 1;
}
}
return 0;
}
int main()
{
int a[10];
int b;
for (int i = 0; i < 10; i++)
a[i] = i + 1;
int t;
cin >> t;
while (t--)
{
cin >> b;
flag=f(a,10,b);
if (flag)
cout << "yes" << endl;
else
cout << "no" << endl;
}
}