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.

Examples

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: <image> The variant of the polyline in the second sample: <image> The variant of the polyline in the third sample: <image>

// Problem : D. Polyline
// Contest : Codeforces Round #340 (Div. 2)
// URL : https://codeforces.com/contest/617/problem/D
// Memory Limit : 256 MB
// Time Limit : 1000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)

import java.io.*;
import java.util.*;

public class a {

	public static void main(String[] args) {
		FastReader scan = new FastReader();
		PrintWriter out = new PrintWriter(System.out);
		Task solver = new Task();
		//int t = scan.nextInt();
		int t = 1;
		for(int i = 1; i <= t; i++) solver.solve(i, scan, out);
		out.close();
	}

	static class Task {

		public void solve(int testNumber, FastReader sc, PrintWriter pw) {
			int[][] arr= {{sc.nextInt(),sc.nextInt()},{sc.nextInt(),sc.nextInt()},{sc.nextInt(),sc.nextInt()}};
			if(arr[0][0]==arr[1][0]&&arr[1][0]==arr[2][0]){
				pw.println(1);
			}
			else if(arr[0][1]==arr[1][1]&&arr[1][1]==arr[2][1]){
				pw.println(1);
			}
			else if(arr[0][0]==arr[1][0]&&arr[2][1]>=arr[1][1]&&arr[2][1]>=arr[0][1]){
				pw.println(2);
			}
			else if(arr[0][0]==arr[1][0]&&arr[2][1]<=arr[1][1]&&arr[2][1]<=arr[0][1]){
				pw.println(2);
			}
			else if(arr[0][0]==arr[2][0]&&arr[1][1]>=arr[2][1]&&arr[1][1]>=arr[0][1]){
				pw.println(2);
			}
			else if(arr[0][0]==arr[2][0]&&arr[1][1]<=arr[2][1]&&arr[1][1]<=arr[0][1]){
				pw.println(2);
			}
			else if(arr[2][0]==arr[1][0]&&arr[0][1]>=arr[1][1]&&arr[0][1]>=arr[2][1]){
				pw.println(2);
			}
			else if(arr[2][0]==arr[1][0]&&arr[0][1]<=arr[1][1]&&arr[0][1]<=arr[2][1]){
				pw.println(2);
			}
			
			else if(arr[0][1]==arr[1][1]&&arr[2][0]>=arr[1][0]&&arr[2][0]>=arr[0][0]){
				pw.println(2);
			}
			else if(arr[0][1]==arr[1][1]&&arr[2][0]<=arr[1][0]&&arr[2][0]<=arr[0][0]){
				pw.println(2);
			}
			else if(arr[0][1]==arr[2][1]&&arr[1][0]>=arr[2][0]&&arr[1][0]>=arr[0][0]){
				pw.println(2);
			}
			else if(arr[0][1]==arr[2][1]&&arr[1][0]<=arr[2][0]&&arr[1][0]<=arr[0][0]){
				pw.println(2);
			}
			else if(arr[2][1]==arr[1][1]&&arr[0][0]>=arr[1][0]&&arr[0][0]>=arr[2][0]){
				pw.println(2);
			}
			else if(arr[2][1]==arr[1][1]&&arr[0][0]<=arr[1][0]&&arr[0][0]<=arr[2][0]){
				pw.println(2);
			}
			else{
				pw.println(3);
			}
			
		}
	}

	static void shuffle(int[] a) {
		Random get = new Random();
		for (int i = 0; i < a.length; i++) {
			int r = get.nextInt(a.length);
			int temp = a[i];
			a[i] = a[r];
			a[r] = temp;
		}
	}

	static void shuffle(long[] a) {
		Random get = new Random();
		for (int i = 0; i < a.length; i++) {
			int r = get.nextInt(a.length);
			long temp = a[i];
			a[i] = a[r];
			a[r] = temp;
		}
	}

	static class FastReader {
		BufferedReader br;
		StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		public FastReader(String s) throws FileNotFoundException {
			br = new BufferedReader(new FileReader(new File(s)));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}

}