CF617D.Polyline

There are three points marked on the coordinate plane. The goal is to make a simple polyline, without self-intersections and self-touches, such that it passes through all these points. Also, the polyline must consist of only segments parallel to the coordinate axes. You are to find the minimum number of segments this polyline may consist of.

坐标平面上标有三个点。目标是构造一条简单折线（即不自交、也不自触），使其经过所有这三个点。此外，该折线仅能由与坐标轴平行的线段组成。你需要求出满足条件的折线所含线段数的最小值。

Each of the three lines of the input contains two integers. The i-th line contains integers x__i and y__i ( - 109 ≤ x__i, y__i ≤ 109) — the coordinates of the i-th point. It is guaranteed that all points are distinct.

输入包含三行，每行包含两个整数。第 $i$ 行包含整数 $x_i$ 和 $y_i$（$-10^9 \le x_i, y_i \le 10^9$），表示第 $i$ 个点的坐标。保证所有点互不相同。

Print a single number — the minimum possible number of segments of the polyline.

输出一个整数——折线的最少线段数。

The variant of the polyline in the first sample: The variant of the polyline in the second sample: The variant of the polyline in the third sample:

第一个样例中的折线变体：
第二个样例中的折线变体：
第三个样例中的折线变体：