1 #include<cstdio>
 2 #include<cmath>
 3
 4 using namespace std;
 5
 6 const int maxn=110;
 7 const int T=100000;
 8 const int INF=0x7fffffff;
 9 const double eps=1e-8;
10 const double delta=0.98;
11
12 struct Node{double x,y;}node[maxn];
13
14 int n;
15 int dx[4]={0,0,1,-1};
16 int dy[4]={1,-1,0,0};
17
18 inline double dis(Node A,Node B){
19     return sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));
20 }
21
22 double sum_dis(Node A){
23     double sum=0;
24     for(int i=1;i<=n;i++)
25         sum+=dis(A,node[i]);
26     return sum;
27 }
28
29 void search(){
30     Node Ans=node[1],Now;
31     double t=T,res=INF;
32     bool find;
33     while(t>eps){
34         find=true;
35         while(find){
36             find=false;
37             for(int j=0;j<4;j++){
38                 Now.x=Ans.x+dx[j]*t;
39                 Now.y=Ans.y+dy[j]*t;
40                 double Dis=sum_dis(Now);
41                 if(Dis<res)
42                     res=Dis,Ans=Now,find=true;
43             }
44         }
45         t=t*delta;
46     }
47     if(res-(int)(res)>0.5)
48         printf("%d\n", (int)(res+1));
49     else
50         printf("%d\n", (int)(res));
51 }
52
53 int main(){
54 #ifndef ONLINE_JUDGE
55     freopen("Poj2420.in","r",stdin);
56     freopen("Poj2420.out","w",stdout);
57 #endif
58
59     while(~scanf("%d",&n)){
60         for(int i=1;i<=n;i++)
61             scanf("%lf%lf",&node[i].x,&node[i].y);
62         search();
63     }
64
65     return 0;
66 }