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>
import java.util.*;import java.io.*;import java.math.*;
public class Main
{
    static class Node{
        int x,y;
        Node(int x,int y)
        {
            this.x=x;
            this.y=y;
        }
    }
    public static class CustomSort implements Comparator<Node>{
        public int compare(Node a,Node b){
                if(a.x!=b.x)
                    return a.x-b.x;
                return (a.y-b.y);
        }
    }
    public static class CustomSort2 implements Comparator<Node>{
        public int compare(Node a,Node b){
                if(a.y!=b.y)
                    return a.y-b.y;
                return (a.x-b.x);
        }
    }
    public static void process()throws IOException
    {
        Node[]A=new Node[3];
        HashSet<Integer>x=new HashSet<>();
        HashSet<Integer>y=new HashSet<>();
        for(int i=0;i<3;i++)
        {
            A[i]=new Node(ni(),ni());
            x.add(A[i].x);
            y.add(A[i].y);
        }
        int ans=Math.min(x.size(),y.size());
        if(ans==2)
        {
            Arrays.sort(A,new CustomSort());
            if(A[0].x==A[1].x)
            {
                if(!((A[2].y>=A[0].y && A[2].y>=A[1].y)||(A[2].y<=A[0].y && A[2].y<=A[1].y)))
                {
                    pn(3);
                    return;
                }
            }
            if(A[1].x==A[2].x)
            {
                if(!((A[0].y>=A[1].y && A[0].y>=A[2].y)||(A[0].y<=A[1].y && A[0].y<=A[2].y)))
                {
                    pn(3);
                    return;
                }
            }
            Arrays.sort(A,new CustomSort2());
            if(A[0].y==A[1].y)
            {
                if(!((A[2].x>=A[0].x && A[2].x>=A[1].x)||(A[2].x<=A[0].x && A[2].x<=A[1].x)))
                {
                    pn(3);
                    return;
                }
            }
            if(A[1].y==A[2].y)
            {
                if(!((A[0].x>=A[1].x && A[0].x>=A[2].x)||(A[0].x<=A[1].x && A[0].x<=A[2].x)))
                {
                    pn(3);
                    return;
                }
            }
        }
        pn(ans);
    }

    static long mod=(long)1e8;
    static AnotherReader sc;
    static PrintWriter out;
    public static void main(String[]args)throws IOException
    {
        boolean oj = true;
        if(oj){sc=new AnotherReader();out=new PrintWriter(System.out);}
        else{sc=new AnotherReader(100);out=new PrintWriter("output.txt");}
        int t=1;
        // t=ni();
        while(t-->0) {process();}
        out.flush();out.close();  
    }

    static void pn(Object o){out.println(o);}
    static void p(Object o){out.print(o);}
    static void pni(Object o){out.println(o);out.flush();}
    static int ni()throws IOException{return sc.nextInt();}
    static long nl()throws IOException{return sc.nextLong();}
    static double nd()throws IOException{return sc.nextDouble();}
    static String nln()throws IOException{return sc.nextLine();}
    static int[] nai(int N)throws IOException{int[]A=new int[N];for(int i=0;i!=N;i++){A[i]=ni();}return A;}
    static long[] nal(int N)throws IOException{long[]A=new long[N];for(int i=0;i!=N;i++){A[i]=nl();}return A;}
    static long gcd(long a, long b)throws IOException{return (b==0)?a:gcd(b,a%b);}
    static int gcd(int a, int b)throws IOException{return (b==0)?a:gcd(b,a%b);}
    static int bit(long n)throws IOException{return (n==0)?0:(1+bit(n&(n-1)));}

/////////////////////////////////////////////////////////////////////////////////////////////////////////

    static class AnotherReader{BufferedReader br; StringTokenizer st;
    AnotherReader()throws FileNotFoundException{
    br=new BufferedReader(new InputStreamReader(System.in));}
    AnotherReader(int a)throws FileNotFoundException{
    br = new BufferedReader(new FileReader("input.txt"));}
    String next()throws IOException{
    while (st == null || !st.hasMoreElements()) {try{
    st = new StringTokenizer(br.readLine());}
    catch (IOException  e){ e.printStackTrace(); }}
    return st.nextToken(); } int nextInt() throws IOException{
    return Integer.parseInt(next());}
    long nextLong() throws IOException
    {return Long.parseLong(next());}
    double nextDouble()throws IOException { return Double.parseDouble(next()); }
    String nextLine() throws IOException{ String str = ""; try{
    str = br.readLine();} catch (IOException e){
    e.printStackTrace();} return str;}}
   
/////////////////////////////////////////////////////////////////////////////////////////////////////////////
}



