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>
/* package codechef; // don't place package name! */

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

/* Name of the class has to be "Main" only if the class is public. */
public class Codeforces
{
    static class Point implements Comparable<Point>{
    	int x, y;
    	
    	Point(int _x, int _y){
    		x = _x;
    		y = _y;
    	}
    	
    	public int compareTo(Point comp){
    		if (x != comp.x) return x - comp.x;
    		else return y - comp.y;
    	}
    };
	static int find(Point[] p){
	    
	    /*for (int i = 0; i < 3; ++i){
	        System.out.println(p[i].x + " " + p[i].y);
	    }*/
		if (p[0].x == p[1].x){
			if (p[1].x == p[2].x) return 1;
			else if (p[1].y <= p[2].y || p[0].y == p[2].y) return 2;
			else if (p[0].y >= p[2].y) return 2;
			else return 3;
		} else {
			if (p[0].y == p[1].y){
				if (p[1].y == p[2].y) return 1;
				else return 2;
			}else if (p[0].y == p[2].y){
				if (p[2].x == p[1].x) return 2;
				else return 3;
			}else if (p[1].x == p[2].x){
			    if (p[1].y > p[0].y && p[2].y > p[0].y) return 2;
			    else if (p[1].y < p[0].y && p[2].y < p[0].y) return 2;
			    else return 3;
			}
			else if (p[1].y == p[2].y){
			    return 2;
			}
			else return 3;
		}
	}
    public static void main (String[] args) throws java.lang.Exception
    {
        Scanner sc = new Scanner(System.in);
        out = new PrintWriter(new BufferedOutputStream(System.out));
		
		Point[] points = new Point[3];
		for (int i = 0; i < 3; ++i){
			int x = sc.nextInt();
			int y = sc.nextInt();
			points[i] = new Point(x, y);
		}
		
		Arrays.sort(points);
		int res = find(points);
		out.println(res);
		out.close();
    }
    
    public static PrintWriter out;
      
   //-----------MyScanner class for faster input----------
   public static class MyScanner {
      BufferedReader br;
      StringTokenizer st;
 
      public MyScanner() {
         br = new BufferedReader(new InputStreamReader(System.in));
      }
 
      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;
      }
 
   }
}