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.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.TreeMap;

public class Main {
	static ContestScanner in;static Writer out;public static void main(String[] args)
	{try{in=new ContestScanner();out=new Writer();Main solve=new Main();solve.solve(in,out);
	in.close();out.close();}catch(IOException e){e.printStackTrace();}}
	void dump(int[]a){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();}
	void dump(int[]a,int n){for(int i=0;i<a.length;i++)out.printf("%"+n+"d",a[i]);out.println();}
	void dump(long[]a){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();}
	void dump(char[]a){for(int i=0;i<a.length;i++)out.print(a[i]);out.println();}
	long pow(long a,int n){long r=1;while(n>0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;}
	String itob(int a,int l){return String.format("%"+l+"s",Integer.toBinaryString(a)).replace(' ','0');}
	void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);}
	void m_sort(int[]a,int s,int sz,int[]b)
	{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
	m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
	while(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];}
	while(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];
	} /* qsort(3.5s)<<msort(9.5s)<<<shuffle+qsort(17s)<Arrays.sort(Integer)(20s) */
	void swap(int[] a,int i,int j){final int t=a[i];a[i]=a[j];a[j]=t;}
	int binarySearchSmallerMax(int[]a,int v)// get maximum index which a[idx]<=v
	{int l=0,r=a.length-1,s=0;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return a[s]>v?-1:s;}
	void solve(ContestScanner in,Writer out) throws NumberFormatException, IOException{
		int[] x = new int[3];
		int[] y = new int[3];
		for(int i=0; i<3; i++){
			x[i] = in.nextInt();
			y[i] = in.nextInt();
		}
		if(x[0]==x[1]&&x[1]==x[2] || y[0]==y[1]&&y[1]==y[2]){
			System.out.println(1);
			return;
		}
		int res = 3;
		for(int i=0; i<3; i++){
			for(int j=i+1; j<3; j++){
				final int k = 3-i-j;
				if(x[i]==x[j]){
					int b = Math.min(y[i], y[j]);
					int t = Math.max(y[i], y[j]);
					if(out(b, t, y[k])) res = 2;
				}else if(y[i]==y[j]){
					int l = Math.min(x[i], x[j]);
					int r = Math.max(x[i], x[j]);
					if(out(l, r, x[k])) res = 2;
				}
			}
		}
		System.out.println(res);
	}
	
	boolean out(int l, int r, int x){
		return x<=l || r<=x;
	}
}

class RangeMinimumSegTree{
	int[] tree;
	int[] idx;
	int size;
	int len;
	int n;
	public RangeMinimumSegTree(int n){
		int beki = 1;
		while(beki < n) beki <<= 1;
		len = beki<<1;
		this.n = n;
		tree = new int[len];
		idx = new int[len];
		Arrays.fill(tree, Integer.MAX_VALUE);
		size = beki;
	}
	public void set(int id, int x){
		int i = id | size;
		tree[i] = x;
		idx[i] = id;
		for(i>>=1; i>0; i>>=1){
//			tree[i] = Math.min(tree[i<<1], tree[(i<<1)+1]);
			if(tree[i<<1]<tree[(i<<1)+1]){
				tree[i] = tree[i<<1];
				idx[i] = idx[i<<1];
			}else{
				tree[i] = tree[(i<<1)+1];
				idx[i] = idx[(i<<1)+1];
			}
		}
	}
	public int get(int id){
		return tree[id|size];
	}
	// in idx: left to right
	public long min(int left, int right){
		int res = Integer.MAX_VALUE;
		left |= size;
		right|= size;
		right++;
		int id = 0;
		while(left < right){
			if((right&1) == 1){
//				res = Math.min(res, tree[--right]);
				if(res > tree[--right]){
					res = tree[right];
					id = idx[right];
				}
			}
			if((left&1) == 1){
//				res = Math.min(res, tree[left++]);
				if(res > tree[left]){
					res = tree[left];
					id = idx[left];
				}left++;
			}
			right >>= 1;
			left >>= 1;
		}
		return (long)id<<32|res;
	}
}

class RangeMaximumSegTree{
	int[] tree;
	int[] idx;
	int size;
	int len;
	int n;
	public RangeMaximumSegTree(int n){
		int beki = 1;
		while(beki < n) beki <<= 1;
		len = beki<<1;
		this.n = n;
		tree = new int[len];
		idx = new int[len];
		Arrays.fill(tree, 0);
		size = beki;
	}
	public void set(int id, int x){
		int i = id | size;
		tree[i] = x;
		idx[i] = id;
		for(i>>=1; i>0; i>>=1){
//			tree[i] = Math.max(tree[i<<1], tree[(i<<1)+1]);
			if(tree[i<<1]>tree[(i<<1)+1]){
				tree[i] = tree[i<<1];
				idx[i] = idx[i<<1];
			}else{
				tree[i] = tree[(i<<1)+1];
				idx[i] = idx[(i<<1)+1];
			}
		}
	}
	public int get(int id){
		return tree[id|size];
	}
	// in idx: left to right
	public long max(int left, int right){
		int res = 0;
		left |= size;
		right|= size;
		right++;
		int id = 0;
		while(left < right){
			if((right&1) == 1){
//				res = Math.max(res, tree[--right]);
				if(tree[--right]>res){
					res = tree[right];
					id = idx[right];
				}
			}
			if((left&1) == 1){
//				res = Math.max(res, tree[left++]);
				if(tree[left]>res){
					res = tree[left];
					id = idx[left];
				}left++;
			}
			right >>= 1;
			left >>= 1;
		}
		return (long)id<<32|res;
	}
}

 
class MultiSet<T> extends HashMap<T, Integer>{
	@Override
	public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key)
	{final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
}
class OrderedMultiSet<T> extends TreeMap<T, Integer>{
	@Override
	public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key)
	{final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
}
class Pair implements Comparable<Pair>{
	int a,b;int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;}
	public boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;}
	public int hashCode(){return hash;}
	public int compareTo(Pair o){if(a!=o.a)return a<o.a?-1:1;else if(b!=o.b)return b<o.b?-1:1;return 0;}
}
class Timer{
	long time;
	public void set(){time=System.currentTimeMillis();}
	public long stop(){return time=System.currentTimeMillis()-time;}
	public void print()
	{System.out.println("Time: "+(System.currentTimeMillis()-time)+"ms");}
	@Override public String toString(){return"Time: "+time+"ms";}
}
class Writer extends PrintWriter{
	public Writer(String filename)throws IOException
	{super(new BufferedWriter(new FileWriter(filename)));}
	public Writer()throws IOException{super(System.out);}
}
class ContestScanner implements Closeable{
	private BufferedReader in;private int c=-2;
	public ContestScanner()throws IOException 
	{in=new BufferedReader(new InputStreamReader(System.in));}
	public ContestScanner(String filename)throws IOException
	{in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
	public String nextToken()throws IOException {
		StringBuilder sb=new StringBuilder();
		while((c=in.read())!=-1&&Character.isWhitespace(c));
		while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	public String readLine()throws IOException{
		StringBuilder sb=new StringBuilder();if(c==-2)c=in.read();
		while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	public long nextLong()throws IOException,NumberFormatException
	{return Long.parseLong(nextToken());}
	public int nextInt()throws NumberFormatException,IOException
	{return(int)nextLong();}
	public double nextDouble()throws NumberFormatException,IOException 
	{return Double.parseDouble(nextToken());}
	public void close() throws IOException {in.close();}
}