#include <bits/stdc++.h>
using namespace std;
#define mkp make_pair
int DistanceSum(int N, int *X, int *Y) {
map<pair<int,int>,bool> con;
for(int i=0;i<N;i++){
con[mkp(X[i],Y[i])]=true;
}
int ans=0,nans=1;
vector<int> distx={1,0,-1,0},disty={0,1,0,-1};
for(int i=0;i<N;i++){
queue<pair<int,int>> q;
q.push(mkp(X[i],Y[i]));
map<pair<int,int>,bool> visited;
while(q.size()){
pair<int,int> nodo=q.front();
q.pop();
visited[nodo]=true;
for(int i=0;i<4;i++){
if(con.count(mkp(nodo.first-distx[i],nodo.second-disty[i])) || visited.count(mkp(nodo.first-distx[i],nodo.second-disty[i])))continue;
q.push(mkp(nodo.first-distx[i],nodo.second-disty[i]));
visited[mkp(nodo.first-distx[i],nodo.second-disty[i])]=true;
ans+=nans;
ans%=1000000000;
}
nans++;
}
}
return ans;
}
