Polyline

1000ms

262144K

Description:

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.

Input:

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

Output:

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

Sample Input:

1 -1
1 1
1 2

Sample Output:

Sample Input:

-1 -1
-1 3
4 3

Sample Output:

Sample Input:

1 1
2 3
3 2

Sample Output:

Note:

The variant of the polyline in the first sample: $\text{[math]}$ The variant of the polyline in the second sample: $\text{[math]}$ The variant of the polyline in the third sample: $\text{[math]}$

Informação

Provedor Codeforces

Código CF617D