#include<bits/stdc++.h>
using namespace std;

vector<int> sieve(int n){
  vector<int> prime;
  vector<bool> isprime(n+1,true);
  isprime[1]=false;
  for (int i=2;i<=n;i++){
    if (!isprime[i]) continue;
    prime.push_back(i);
    for (int j=i*2;j<=n;j+=i){
      isprime[j]=false;
    }
  }
  return prime;
}

int main(){
  int t;
  cin>>t;
  while (t--){
    long long n;
    cin>>n;
    if (n==1||n==4||n==6) cout<<"No\n";
    else cout<<"Yes\n";
  }
}