//#include "city.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(), x.end()
const int N = 1e4+4, inf = INT_MAX;
const vector<pair<int, int>> dir = {{-1, 0}, {0, -1}, {1, 0}, {0, 1}};
ll ans;
bitset<N> cell[N], vis[N];
bool ok(int x, int y) {
return min(x, y) >= 0;
}
void bfs(int X, int Y) {
queue<tuple<int, int, int>> q;
q.push(make_tuple(0, X, Y));
while (!q.empty()) {
int d = get<0>(q.front());
int x = get<1>(q.front());
int y = get<2>(q.front());
q.pop();
if (vis[x][y]) continue;
vis[x][y] = 1;
ans += d;
for (auto [a, b] : dir) {
if (ok(x+a, y+b) &&
cell[x+a][y+b] &&
!vis[x+a][y+b]) {
q.push(make_tuple(d+1, x+a, y+b));
}
}
}
}
int DistanceSum(int N, int *X, int *Y) {
ans = 0;
int mnX = inf;
int mnY = inf;
for (int i = 0; i < N; i++) {
mnX = min(mnX, X[i]);
mnY = min(mnY, Y[i]);
}
for (int i = 0; i < N; i++) {
X[i] -= mnX;
Y[i] -= mnY;
cell[X[i]][Y[i]] = 1;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
vis[X[j]][Y[j]] = 0;
}
bfs(X[i], Y[i]);
}
return ans/2;
}
