Polygon — Eolymp

Input

The first line contains an integer $N$ — the number of vertical sides. Each of the next $N$ lines contains three integers $X$ , $Y_{1}$ Y_1, $Y_{2}$ Y_2, describing a vertical side with endpoints $(X, Y_{1})$ (X, Y_1) and $(X, Y_{2})$ (X, Y_2).

Constraints: $N < 10000$ N < 10000; $∣ X ∣ \leq 1000$ |X| \leq 1000; $∣ Y ∣ \leq 1000$ |Y| \leq 1000, where $(X, Y)$ (X, Y) are the coordinates of the vertices. The sides of the polygon do not intersect, and each vertex belongs to exactly two sides of the polygon.

Output

Output two numbers: $P$ and $S$ .

Examples

Example 1

Loading