1 #include <algorithm>
 2 #include <iostream>
 3 #include <iomanip>
 4 #include <cstring>
 5 #include <climits>
 6 #include <complex>
 7 #include <cassert>
 8 #include <cstdio>
 9 #include <bitset>
10 #include <vector>
11 #include <deque>
12 #include <queue>
13 #include <stack>
14 #include <ctime>
15 #include <set>
16 #include <map>
17 #include <cmath>
18 using namespace std;
19
20 typedef pair<double, double> pdd;
21 #define x first
22 #define y second
23 const double eps = 1e-8;
24 const double delta = 0.98;
25 const int maxn = 10100;
26 const int dx[5] = {1, -1, 0, 0};
27 const int dy[5] = {0, 0, 1, -1};
28 int n;
29 double ret;
30 pdd cur;
31 pdd p[maxn];
32
33 double dist(pdd a, pdd b) {
34     double p = a.x - b.x;
35     double q = a.y - b.y;
36     return sqrt(p * p + q * q);
37 }
38
39 int main() {
40     // freopen("in", "r", stdin);
41     while(~scanf("%d", &n)) {
42         for(int i = 0; i < n; i++) {
43             scanf("%lf %lf", &p[i].x, &p[i].y);
44         }
45         int t = 100;
46         ret = 1e100;
47         cur = pdd(.0, .0);
48         while(t > eps) {
49             bool flag = 1;
50             while(flag) {
51                 flag = 0;
52                 for(int i = 0; i < 4; i++) {
53                     pdd pos = pdd(cur.x+dx[i]*t, cur.y+dy[i]*t);
54                     double tmp = .0;
55                     for(int j = 0; j < n; j++) {
56                         tmp += dist(pos, p[j]);
57                     }
58                     if(ret - tmp > eps) {
59                         ret = tmp;
60                         cur = pos;
61                         flag = 1;
62                         break;
63                     }
64                 }
65             }
66             t *= delta;
67         }
68         printf("%.0f\n", ret);
69     }
70     return 0;
71 }