#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#include <string>
#include <set>
using namespace std;

typedef long long ll;
const double pi=acos(-1.0);
const int inf = 0x3f3f3f3f;
const ll mod=1000000007;
const int maxn=50050;
const ll N=11;
const double pai=3.14159265358979;
const ll maxn2=1e3+2;
#define mem(a,b) memset(a,b,sizeof(a))
const int MAXN=3e7;
int main()
{
    int t;
    double n;
    scanf("%d",&t);
    while (t--)
    {
        scanf("%lf",&n);
        if(n-1<1e-6)
            puts("Yes");
        else
            puts("No");
    }
    return 0;
}