#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

void sub(string& s,int m){
    while(1){
        if(s[m]=='1'){
            s[m]='0';
            break;
        }
        else {
            s[m]='1';
            ++m;
        }
    }
    while(s.back()=='0')s.pop_back();
}

int main(){
    int n;
    cin>>n;
    string s(2*n,'0');
    s+='1';
    rep(i,n){
        int x;
        cin>>x;
        x=2*n-min(2*n,x);
        if(x>=s.size()){
            cout<<"No"<<endl;
        }
        else {
            cout<<"Yes"<<endl;
            sub(s,x);
        }
        //cout<<s<<endl;
    }
    return 0;
}
