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>
	// Main Code at the Bottom
	import java.util.*;
	import java.io.*; 
	public class Main{
		//Fast IO class
	    static class FastReader {
	        BufferedReader br; 
	        StringTokenizer st; 
	        public FastReader() {
	        	boolean env=System.getProperty("ONLINE_JUDGE") != null;
	        	//env=true;
	        	if(!env) {
	        		try {
						br=new BufferedReader(new FileReader("src\\input.txt"));
					} catch (FileNotFoundException e) {
						e.printStackTrace();
					}
	        	}
	        	else 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; 
	        } 
	    }     
	    static long MOD=(long)1e9+7;
	    //debug
	    static void debug(Object... o) {
	        System.out.println(Arrays.deepToString(o));
	    }
	    static FastReader sc=new FastReader();
	    static PrintWriter out=new PrintWriter(System.out);  
	    //Global variables and functions
	    static int check(int p1[],int p2[]) {
	    	int x1=p1[0],y1=p1[1],x2=p2[0],y2=p2[1];
	    	if(x1==x2) return 1;
	    	if(y1==y2) return 2;
	    	return 0;
	    	
	    }
	    //Main function(The main code starts from here)
	    public static void main (String[] args) throws java.lang.Exception {
	    	int test=1;
	    	//test=sc.nextInt();
	    	while(test-->0) {
	    		int p[][]=new int[3][2];
	    		for(int i=0;i<3;i++) {
	    			p[i][0]=sc.nextInt();
	    			p[i][1]=sc.nextInt();
	    		}
	    		if(check(p[0],p[1])==check(p[1],p[2]) && check(p[0],p[1])!=0) out.println(1);
	    		else if(check(p[0],p[1])>0 || check(p[0],p[2])>0 || check(p[1],p[2])>0) {
	    			if(check(p[0],p[2])>0) {
	    				int tmp[]=p[2];
	    				p[2]=p[1];
	    				p[1]=tmp;
	    			}
	    			else if(check(p[1],p[2])>0) {
	    				int tmp[]=p[2];
	    				p[2]=p[0];
	    				p[0]=tmp;
	    			}
	    			if(check(p[0],p[1])==1) {
	    				if(Math.min(p[0][1], p[1][1])<p[2][1] && p[2][1]<Math.max(p[0][1], p[1][1])) out.println(3);
	    				else out.println(2);
	    			}
	    			else if(check(p[0],p[1])==2) {
	    				if(Math.min(p[0][0], p[1][0])<p[2][0] && p[2][0]<Math.max(p[0][0], p[1][0])) out.println(3);
	    				else out.println(2);
	    			}
	    		}
	    		else out.println(3);
	    		
	    	}
	        out.flush();
	        out.close();
	    }
	}