Codeforces Round 340 (Div 2)D Polyline 【枚举】【思维】

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 xi and yi ( - 109 ≤ xi, yi ≤ 109) — 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.

Example

Input

1 -1
1 1
1 2

Output

1

Input

-1 -1
-1 3
4 3

Output

2

Input

1 1
2 3
3 2

Output

3

Note

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:

题意：

有3个点，给你每个点的坐标。
问你，我们至少要画几条连续的线段（不可分叉），使得3个点都在线段上。

思路：

1，三点共线：1
2，任意两点横纵坐标都不相同：3
3，两点共线，且第三点在这条线段”内”（比如0 0，0 10，5 5）：3
4，两点共线，且第三点在这条线段”外”（比如0 0，0 10，5 15）：2

ac代码：

#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
long long x[5] = {0}, y[5] = {0};
int main()
{
    cin >> x[0] >> y[0];
    cin >> x[1] >> y[1];
    cin >> x[2] >> y[2];
    int result = 0;
    if(x[0]==x[1] && x[1]==x[2] || y[0]==y[1] && y[1]==y[2])
        result = 1;
    else if(x[0]!=x[1] && x[0]!=x[2] && x[1]!=x[2] && y[0]!=y[1] && y[0]!=y[2] && y[1]!=y[2])
        result = 3;
    else if(  ( x[0]==x[1] && (y[0]<y[2] && y[2]<y[1] || y[1]<y[2] && y[2]<y[0]) ) || 
              ( x[0]==x[2] && (y[0]<y[1] && y[1]<y[2] || y[2]<y[1] && y[1]<y[0]) ) ||
              ( x[1]==x[2] && (y[1]<y[0] && y[0]<y[2] || y[2]<y[0] && y[0]<y[1]) ) )
        result = 3;
    else if(  ( y[0]==y[1] && (x[0]<x[2] && x[2]<x[1] || x[1]<x[2] && x[2]<x[0]) ) || 
              ( y[0]==y[2] && (x[0]<x[1] && x[1]<x[2] || x[2]<x[1] && x[1]<x[0]) ) ||
              ( y[1]==y[2] && (x[1]<x[0] && x[0]<x[2] || x[2]<x[0] && x[0]<x[1]) ) )
        result = 3;
    else
        result = 2;
    cout << result << endl;
}