// Slower C++ solution:
#include<bits/stdc++.h>

#define LL long long

#define MEM(x,y) memset(x,y,sizeof(x))

#define MOD(x) ((x)%mod)

#define mod 1000000007

#define pb push_back

#define STREAM_FAST ios::sync_with_stdio(false)



using namespace std;

const int maxn = 2e5+7;

int f[maxn];

struct node

{

    int u,v;LL w;

    node(int u,int v,LL w):u(u),v(v),w(w){}

    node(){}

    bool operator < (const node &rhs) const

    {

        return w<rhs.w;

    }

}edge[maxn];



struct P

{

    int id;LL val;

    P(int id,LL val):id(id),val(val){}

    P(){}

    bool operator < (const P &rhs) const

    {

        return val<rhs.val;

    }

}x[maxn],y[maxn];



int find(int x)

{

    if (x==f[x]) return x;

    return f[x]=find(f[x]);

}



int main()

{

    int n;scanf("%d",&n);

    for (int i=1;i<=2*n;i++) f[i]=i;

    for (int i=1;i<=n;i++)

    {

        scanf("%lld %lld",&x[i].val,&y[i].val);

        x[i].id=y[i].id=i;

    }

    sort(x+1,x+1+n);

    sort(y+1,y+1+n);

    

    int tot=0;

    for (int i=2;i<=n;i++)

    {

        edge[++tot]=node(x[i-1].id,x[i].id,x[i].val-x[i-1].val);

        edge[++tot]=node(y[i-1].id,y[i].id,y[i].val-y[i-1].val);

    }

    

    sort(edge+1,edge+1+tot);

    

    int cnt=0;LL ans=0;

    for (int i=1;i<=tot;i++)

    {

        int u=find(edge[i].u),v=find(edge[i].v);

        if (u!=v)

        {

            ++cnt;

            f[u]=v;

            ans+=edge[i].w;

        }

        if (cnt==n-1) break; 

    }

    printf("%lld\n",ans);

    return 0;

}










// Faster C++ solution for the same problem (measured speedup: 5.10720241283453x):
#include <stdio.h>

#include <stdlib.h>

#include <algorithm>



// 全局变量

const int N = 100010 , M = N + N;

int x[N],y[N],id[N],n;



typedef struct ufset *UFset;

struct ufset

{

  int *parent;

  int *root;

};

UFset UFinit(int size)

{

  int e;

  UFset U=(UFset)malloc(sizeof *U);

  U->parent=(int*)malloc((size+1)*sizeof(int));

  U->root=(int*)malloc((size+1)*sizeof(int));

  for(e=1; e<=size; e++)

  {

    U->parent[e]=1;

    U->root[e]=1;

  }

  return U;

}

int UFfind(int e,UFset U)

{

  int i,j = e;

  while(!U->root[j]) j = U->parent[j];

  while(j!=e){

    i = U->parent[e];

    U->parent[e]=j;

    e=i;

  }

  return j;

}

int UFunion(int i,int j,UFset U)

{

  if(U->parent[i]<U->parent[j])

  {

    U->parent[j]+=U->parent[i];

    U->root[i]=0;

    U->parent[i]=j;

    return j;

  }

  else

  {

    U->parent[i]+=U->parent[j];

    U->root[j]=0;

    U->parent[j]=i;

    return i;

  }

}



// 记录优化后的边集数

struct Edge

{

  int u, v, cost;

  bool operator <(const Edge&b) const

  {

    return cost < b.cost;

  }

} edge[M];

int tot;

// 按照X轴排序

bool cmpX(int a, int b)

{

  return x[a] < x[b];

}

// 按照Y轴排序

bool cmpY(int a, int b)

{

  return y[a] < y[b];

}

void add(int c, int a, int b)

{

  edge[tot].cost = c;

  edge[tot].u = a;

  edge[tot++].v = b;

}

void Work()

{

    scanf("%d", &n);

  int i;

  for (i = 1; i <= n; ++i)

  {

    scanf("%d%d", x + i, y + i);

    id[i] = i;

  }

  std::sort(id + 1 , id + n + 1, cmpX);

  for (i = 2; i <= n; ++i)

    add(x[id[i]] - x[id[i - 1]], id[i], id[i - 1]);

  std::sort(id + 1 , id + n + 1, cmpY);

  for (i = 2; i <= n; ++i)

    add(y[id[i]] - y[id[i - 1]], id[i], id[i - 1]);

  UFset UFS = UFinit(n);



  // 按照花费排序

  std::sort(edge, edge + tot);

  long long totcost = 0;

  for (i = 0; i < tot; ++i)

  {

    int u = edge[i].u, v = edge[i].v;

    u = UFfind(u,UFS), v = UFfind(v,UFS);

    if (u != v)

    {

      UFunion(u,v,UFS);

      totcost += edge[i].cost;

    }

  }

  printf("%lld\n", totcost);

}

int main()

{

  Work();

  return 0;

}