#include <bits/stdc++.h>usingnamespacestd;
typedeflonglong ll;
typedef pair<ll,ll> pii;
#define fi first#define se second#define pb push_back#define mp make_pairconst ll inf = 1e15;
int p[3][2];
inlineint getK(int i,int j){
int k = 0;
for (k=0;k<3;k++){
if (k != i && k != j)
break;
}
return k;
}
int main(){
for (int i=0;i<3;i++){
cin>>p[i][0]>>p[i][1];
}
int flag = 0;
for (int i=0;i<2;i++){
int f = 0;
for (int j=1;j<3;j++){
if (p[j][i] != p[j-1][i]){
f = 1;
break;
}
}
if (f == 0)
{
flag = 1;
break;
}
}
if (flag)
{
puts("1");
return0;
}
for (int i=0;i<3;i++){
for (int j=i+1;j<3;j++){
int k = getK(i,j);
for (int t=0;t<2;t++){
if (p[i][t] == p[j][t] && (p[k][t^1] <= min(p[i][t^1],p[j][t^1]) || p[k][t^1] >= max(p[i][t^1],p[j][t^1])) ){
flag = 1;
goto Label1;
}
}
}
}
Label1:
if (flag){
puts("2");
}
else{
puts("3");
}
return0;
}