// Slower C++ solution:
#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<iostream>

#include<vector>

#include<queue>

#include<stack>

#include<map>

#include<set>

using namespace std;

typedef long long ll;

const ll inf=1e18;

const int N=1e5+3;

struct oy{

	int x,y,id;

}a[N],b[N];

struct dio{

	int u,v,w;

}e[N<<1];

bool cmp1(oy a,oy b){return a.x<b.x;}

bool cmp2(oy a,oy b){return a.y<b.y;}

bool cmp3(dio a,dio b){return a.w<b.w;}

int pre[N],n,cnt;

int find(int x){

	return pre[x]==x?x:pre[x]=find(pre[x]);

}

int main(){

    cin>>n;

    for(int i=1;i<=n;i++) pre[i]=i;

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

    	cin>>a[i].x>>a[i].y;

    	a[i].id=b[i].id=i;

    	b[i].x=a[i].x;b[i].y=a[i].y;

    }

    sort(a+1,a+1+n,cmp1);

    sort(b+1,b+1+n,cmp2);

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

    	e[cnt].u=a[i-1].id;

    	e[cnt].v=a[i].id;

    	e[cnt].w=a[i].x-a[i-1].x;

    	cnt++;

    }

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

    	e[cnt].u=b[i-1].id;

    	e[cnt].v=b[i].id;

    	e[cnt].w=b[i].y-b[i-1].y;

    	cnt++;

    }

    int num=0;

    ll ans=0;

    sort(e,e+cnt,cmp3);

    for(int i=0;i<cnt;i++){

    	int x=find(e[i].u),y=find(e[i].v);

    	if(x!=y){

    		pre[x]=y;

    		ans+=e[i].w;

    		num++;

    	}

    	if(num==n-1) break;

    }

    cout<<ans<<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.1687380433930965x):
#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;

}

int main()

{

  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);

  return 0;

}