CF1666C.Connect the Points

You are given three points on a plane. You should choose some segments on the plane that are parallel to coordinate axes, so that all three points become connected. The total length of the chosen segments should be the minimal possible.

Two points $a$ and $b$ are considered connected if there is a sequence of points $p_0 = a, p_1, \ldots, p_k = b$ such that points $p_i$ and $p_{i+1}$ lie on the same segment.

给你平面上的三个点。你需要在平面上选择若干条与坐标轴平行的线段，使得这三个点彼此连通。所选线段的总长度应尽可能小。

若存在一个点列 $p_0 = a, p_1, \ldots, p_k = b$，使得每一对相邻点 $p_i$ 与 $p_{i+1}$ 均位于同一条所选线段上，则称两点 $a$ 和 $b$ 是连通的。

The input consists of three lines describing three points. Each line contains two integers $x$ and $y$ separated by a space — the coordinates of the point ($-10^9 \le x, y \le 10^9$). The points are pairwise distinct.

输入包含三行，每行描述一个点。每行包含两个由空格分隔的整数 $x$ 和 $y$ —— 即该点的坐标（$-10^9 \le x, y \le 10^9$）。这三个点两两互不相同。

On the first line output $n$ — the number of segments, at most 100.

The next $n$ lines should contain descriptions of segments. Output four integers $x_1$, $y_1$, $x_2$, $y_2$ on a line — the coordinates of the endpoints of the corresponding segment ($-10^9 \le x_1, y_1, x_2, y_2 \le 10^9$). Each segment should be either horizontal or vertical.

It is guaranteed that the solution with the given constraints exists.

第一行输出 $n$ —— 线段的数量，最多为 100。

接下来的 $n$ 行应包含各线段的描述。每行输出四个整数 $x_1$、$y_1$、$x_2$、$y_2$ —— 对应线段两个端点的坐标（$-10^9 \le x_1, y_1, x_2, y_2 \le 10^9$）。每条线段必须是水平或垂直的。

在给定约束下，保证存在满足要求的解。

The points and the segments from the example are shown below.

示例中的点和线段如下图所示。