Problem F. Function with constraints ≡

Statement

Let's consider a function of the following form: F(X, Y) = AB ⋅ X + CD ⋅ Y.

The task is to find integer values for A, B, C and D, such that for a given set of points (X_i, Y_i)
the specified function satisfies pre-determined conditions:
RoundDawn(F(X_i, Y_i)) = Z_i or RoundUp(F(X_i, Y_i)) = Z_i,
where RoundDawn() и RoundUp() — denote rounding down and rounding up, respectively.

Input format

The input begins with the number N, followed by N conditions, each written in the following format.

First, the operation sign is indicated: '>' for RoundDawn or '<' for RoundUp.

Then, three integers follow: X_i, Y_i, Z_i.

Output format

If the problem has a solution, the output contains the number 1,
followed by the found values of A, B, C and D.

If there is more than one solution, any of them can be output.

If there is no solution, the output is the single number 0.

Constraints

All input values are integers.

 − 40 ≤ (X_i, Y_i, Z_i) ≤ 40, 0 < N ≤ 2000

Sample tests

4

> -2 -5 -6
<  3  7  8
> -1  1  1
<  4 -3 -5

1
-16 37
93 74

4

> -3 -1  1
<  5 -3 -6
>  7  4  1
<  2 -1 -3

0