Problem Statement

Let $\text{dist}(A,B)$ denote the Manhattan distance between points $A$ and $B$.

There are $N$ lattice points $D_i(1\leq i \leq N)$, with coordinates $(x_i,y_i)$. You are given $N$, but you are not given the individual coordinates.

You may ask the following query up to $300$ times.

Choose a lattice point $A$. You are given $\sum_{i=1}^{N}\text{dist}(A,D_i)$.

Using this query, find a lattice point $A$ that minimizes $\sum_{i=1}^{N}\text{dist}(A,D_i)$ among all lattice points. If there are multiple correct answers, finding any $1$ of them is accepted.

Constraints

$1 \leq N \leq 100$

$N$ is an integer.

$-10^8 \leq x_i,y_i \leq 10^8(1\leq i \leq N)$

$D_i(1\leq i \leq N)$ are lattice points.

The coordinates are fixed for each test case. That is, the coordinates do not change depending on the queries.

Input and Output

First, $N$ is given.

$N$

To send a query with $A$ at coordinates $(x,y)$, output in the following format.

$1$ $x$ $y$

The following constraints must be satisfied.

$-10^9 \leq x,y \leq 10^9$

$A$ is a lattice point.

The answer to the query, $d$, is given in the following format.

$d$

To output the answer with coordinates $(x,y)$, output in the following format.

$2$ $x$ $y$

The following constraints must be satisfied.

$-10^9 \leq x,y \leq 10^9$

The answer point is a lattice point.