#include<bits/stdc++.h> using namespace std; int qiu[8]; int main(){ int k,n; cin>>k; while(k--){ cin>>n; memset(a,0,sizeof(a)); for(int j=1;j<=10000;j++){ if(a[j]>max)max=a[j]; } if(max>n/2+1) cout<<"N"<<endl; else cout<<"Y"<<endl; } return 0; }