Dividing the Kingdom

The kingdom of Flatland is an infinite two-dimensional plane. The kingdom has $n$ castles. To make mapmaking easier, Flatland introduced a Cartesian coordinate system. Castle $i$ sits at the point with coordinates $(x_i+0.5, y_i+0.5)$, where $x_i$ and $y_i$ are integers. All castle locations are pairwise distinct.

In his old age, the king decided to divide the kingdom on the map among his sons using lines parallel to the coordinate axes. If a line is parallel to the $Ox$ axis, then the $y$ coordinate of every point on it must be an integer; otherwise the $x$ coordinate of every point must be an integer. In both cases the absolute value of the relevant integer coordinate must not exceed $2 \cdot 10^9$. The king also wants any two castles to end up in different parts after the division.

Help the king divide the kingdom using at most $n-1$ lines. Any pair of lines must share at most one point.

The first line contains the integer $n$ ($1 \le n \le 100\,000$), the number of castles in the kingdom. The next $n$ lines contain two numbers $x_i$ and $y_i$ ($-10^9 \le x_i \le 10^9$, $-10^9 \le y_i \le 10^9$), the integer parts of the castle coordinates.

On the first line, output the number of lines used. On the following lines, output the lines themselves, one per line. If a line is parallel to the $Ox$ axis, output the character y, then a space, then the $y$ coordinate of every point on that line. Otherwise output the character x, then a space, then the $x$ coordinate of every point on that line.