Codeforces Round #395 (Div. 1) B. Timofey and rectangles

#include<bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define eps  1e-2
#define gcd __gcd
#define pb push_back
#define PI acos(-1.0)
#define lowbit(x) (x)&(-x)
#define bug printf("!!!!!\n");
#define mem(x,y) memset(x,y,sizeof(x))

typedef long long LL;
typedef long double LD;
typedef pair<int,int> pii;
typedef unsigned long long uLL;

const int maxn = 1e5+2;
const int INF  = 1<<30;
const int mod  = 1e9+7;

int n;

void solve(){
    cin>>n;
    cout<<"YES"<<endl;
    for(int i=1;i<=n;i++){
        int a,b,c,d;
        cin>>a>>b>>c>>d;
        if(a&1 && b&1){
            cout<<1<<endl;
        }else if((a&1)==0 && (b&1)){
            cout<<2<<endl;
        }else if((a&1)==0 && (b&1)==0){
            cout<<3<<endl;
        }else{
            cout<<4<<endl;
        }
    }
    
    return;
}

int main()
{
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
//    ios::sync_with_stdio(false);
    int t = 1;
    //scanf("%d",&t);
    while(t--){
    //    printf("Case %d: ",cas++);
        solve();
    }
    return 0;
}