Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Timofey and rectangles

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputOne 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

Input

The first line contains single integer *n* (1 ≤ *n* ≤ 5·10^{5}) — the number of rectangles.

*n* lines follow. The *i*-th of these lines contains four integers *x*_{1}, *y*_{1}, *x*_{2} and *y*_{2} ( - 10^{9} ≤ *x*_{1} < *x*_{2} ≤ 10^{9}, - 10^{9} ≤ *y*_{1} < *y*_{2} ≤ 10^{9}), that means that points (*x*_{1}, *y*_{1}) and (*x*_{2}, *y*_{2}) 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 *c*_{i} (1 ≤ *c*_{i} ≤ 4) — the color of *i*-th rectangle.

Example

Input

8

0 0 5 3

2 -1 5 0

-3 -4 2 -1

-1 -1 2 0

-3 0 0 5

5 2 10 3

7 -3 10 2

4 -2 7 -1

Output

YES

1

2

2

3

2

2

4

1

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/23/2017 18:50:15 (c4).

Desktop version, switch to mobile version.
User lists

Name |
---|