Problem:
Score : 500 points

Problem Statement

There are N towns on a plane. The i-th town is located at the coordinates (x_i,y_i). There may be more than one town at the same coordinates.

You can build a road between two towns at coordinates (a,b) and (c,d) for a cost of min(|a-c|,|b-d|) yen (the currency of Japan). It is not possible to build other types of roads.

Your objective is to build roads so that it will be possible to travel between every pair of towns by traversing roads. At least how much money is necessary to achieve this?

Constraints

2 ≤ N ≤ 10^5

0 ≤ x_i,y_i ≤ 10^9

All input values are integers.

Input

Input is given from Standard Input in the following format:

N
x_1 y_1
x_2 y_2
:
x_N y_N

Output

Print the minimum necessary amount of money in order to build roads so that it will be possible to travel between every pair of towns by traversing roads.

Sample Input 1

3
1 5
3 9
7 8

Sample Output 1

3

Build a road between Towns 1 and 2, and another between Towns 2 and 3. The total cost is 2+1=3 yen.

Sample Input 2

6
8 3
4 9
12 19
18 1
13 5
7 6

Sample Output 2

8

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
  
#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
  
using namespace std;
  
typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;
  
const int INF=1<<29;
const double EPS=1e-9;
  
const int dx[]={1,0,-1,0,1,1,-1,-1},dy[]={0,-1,0,1,1,-1,-1,1};

const int mod = 1e9 + 7;

struct Point {
  int x, y;
  int ind;
};

struct Edge {
  int a, b;
  int cost;
  bool operator>(const Edge &rhs) const {
    return cost > rhs.cost;
  }
};

struct UnionFind {
  vector<int> data;
  UnionFind(int size) : data(size, -1) { }
  bool unionSet(int x, int y) {
    x = root(x); y = root(y);
    if (x != y) {
      if (data[y] < data[x]) swap(x, y);
      data[x] += data[y]; data[y] = x;
    }
    return x != y;
  }
  bool findSet(int x, int y) {
    return root(x) == root(y);
  }
  int root(int x) {
    return data[x] < 0 ? x : data[x] = root(data[x]);
  }
  int size(int x) {
    return -data[root(x)];
  }
};

int main() {
  int N;
  cin >> N;
  vector<Point> P(N), PX, PY;
  for (int i = 0; i < N; i++) {
    int x, y; cin >> x >> y;
    P[i] = (Point){x, y, i};
  }
  PX = PY = P;
  sort(PX.begin(), PX.end(), [](Point a, Point b){return a.x < b.x;});
  sort(PY.begin(), PY.end(), [](Point a, Point b){return a.y < b.y;});

  priority_queue<Edge, vector<Edge>, greater<Edge>> Q;
  for (int i = 0; i < N - 1; i++) {
    Q.push((Edge){PX[i].ind, PX[i + 1].ind, PX[i + 1].x - PX[i].x});
    Q.push((Edge){PY[i].ind, PY[i + 1].ind, PY[i + 1].y - PY[i].y});
  }

  UnionFind uf(N);
  ll ans = 0;
  while(!Q.empty()) {
    Edge e = Q.top(); Q.pop();
    if (uf.findSet(e.a, e.b)) continue;
    uf.unionSet(e.a, e.b);
    ans += e.cost;
  }

  cout << ans << endl;

  return 0;
}