CodeForces

B. Timofey and rectangles

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

One of Timofey's birthday presents is a colourbook in a shape of an infinite plane. On the plane n rectangles with sides parallel to coordinate axes are situated. All sides of the rectangles have odd length. Rectangles cannot intersect, but they can touch each other.

Help Timofey to color his rectangles in 4 different colors in such a way that every two rectangles touching each other by side would have different color, or determine that it is impossible.

Two rectangles intersect if their intersection has positive area. Two rectangles touch by sides if there is a pair of sides such that their intersection has non-zero length

The picture corresponds to the first example

Input

The first line contains single integer n (1 ≤ n ≤ 5·105) — the number of rectangles.

n lines follow. The i-th of these lines contains four integers x1, y1, x2 and y2 ( - 109 ≤ x1 < x2 ≤ 109,  - 109 ≤ y1 < y2 ≤ 109), that means that points (x1, y1) and (x2, y2) are the coordinates of two opposite corners of the i-th rectangle.

It is guaranteed, that all sides of the rectangles have odd lengths and rectangles don't intersect each other.

Output

Print "NO" in the only line if it is impossible to color the rectangles in 4 different colors in such a way that every two rectangles touching each other by side would have different color.

Otherwise, print "YES" in the first line. Then print n lines, in the i-th of them print single integer ci (1 ≤ ci ≤ 4) — the color of i-th rectangle.

Example

input

80 0 5 32 -1 5 0-3 -4 2 -1-1 -1 2 0-3 0 0 55 2 10 37 -3 10 24 -2 7 -1

output

YES12232241

题意：给出n个边长为奇数的矩形的坐标，问用四种颜色是否能完成染色，并给出一种染色方案。

题解：根据四色定理知道，四种颜色一定能完成染色。

主要是odd入手，对于一个坐标(x,y),有

x%2==0&&y%2==0

x%2==1&&y%2==0

x%2==0&&y%2==1

x%2==1&&y%2==0

任意相邻的两个矩形，因为odd最后对2取余的结果就是不同的

#include <bits/stdc++.h>using namespace std;int n;int main(){    while(scanf("%d", &n) == 1){        printf("YES\n");        for(int i = 0; i < n; i++){            int x1, y1, x2, y2;            scanf("%d%d%d%d", &x1, &y1, &x2, &y2);            if(x2&1){                printf(y2&1 ? "3\n" : "1\n");            }            else{                printf(y2&1 ? "4\n" : "2\n");            }        }    }}

题意：给出n个边长为奇数的矩形的坐标，问用四种颜色是否能完成染色，并给出一种染色方案。

题解：根据四色定理知道，四种颜色一定能完成染色。

主要是odd入手，对于一个坐标(x,y),有

x%2==0&&y%2==0

x%2==1&&y%2==0

x%2==0&&y%2==1

x%2==1&&y%2==0

任意相邻的两个矩形，因为odd最后对2取余的结果就是不同的