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^{9} ≤ *x*_{*i*}, *y*_{*i*} ≤ 10^{9}$) — 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.
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: 
样例
1 -1
1 1
1 2
1
-1 -1
-1 3
4 3
2
1 1
2 3
3 2
3
题面与样例版权归 Codeforces 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。