#include <iostream>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 7;
int T,n;
double p;
int main(){
    scanf("%d",&T);
    while(T--){
         scanf("%lf",&p);
         if(p>1){
            printf ("No\n");
            continue;
         }
         //double pp=0.5*pp*2+0.5*pp*0.5;
       //  if(pp-p>=1e-9) printf ("Yes\n");
          printf ("Yes\n");
    }
   

}