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

$\text{[math]}$ The picture corresponds to the first example

Input

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

n lines follow. The i-th of these lines contains four integers x₁, y₁, x₂ and y₂ ( - 10⁹ ≤ x₁ < x₂ ≤ 10⁹, - 10⁹ ≤ y₁ < y₂ ≤ 10⁹), that means that points (x₁, y₁) and (x₂, y₂) 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.

Timofey and rectangles

Examples