#include <bits/stdc++.h>
using namespace std;
int n, m, p, q, fa[1001], ffa[1001], ans;
char op;
int find(int x) {
    if (fa[x] == x)
        return x;
    fa[x] = find(fa[x]);
    return fa[x];
}
void hebing(int x, int y) {
    x = find(x);
    y = find(y);
    if (x != y)
        fa[y] = x;
    return;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) fa[i] = i;
    for (int i = 1; i <= m; i++) {
        cin >> op >> p >> q;
        if (op == '0')
            hebing(p, q);
        else {
            if (!ffa[p])
                ffa[p] = find(q);
            else
                hebing(q, ffa[p]);
            if (!ffa[q])
                ffa[q] = find(p);
            else
                hebing(p, ffa[q]);
        }
    }
    for (int i = 1; i <= n; i++)
        if (fa[i] == i)
            ans++;
    cout << ans;
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int n, m, fa[4999999];
struct node {
    int x, y, z;
} a[100001];
bool cmp(node x, node y) { return x.z > y.z; }
int find(int x) {
    if (fa[x] == x)
        return x;
    fa[x] = find(fa[x]);
    return fa[x];
}
void merge(int x, int y) {
    int fx = find(x), fy = find(y);
    if (fx != fy)
        fa[fy] = fx;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n * 2; i++) fa[i] = i;
    for (int i = 1; i <= m; i++) cin >> a[i].x >> a[i].y >> a[i].z;
    sort(a + 1, a + 1 + m, cmp);
    for (int i = 1; i <= m; i++) {
        if (find(a[i].x) == find(a[i].y)) {
            cout << a[i].z;
            return 0;
        }
        merge(a[i].x + n, a[i].y);
        merge(a[i].x, a[i].y + n);
    }
    cout << 0;
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int n, m, fa[4999999];
struct node {
    int x, y, z;
} a[100001];
bool cmp(node x, node y) { return x.z > y.z; }
int find(int x) {
    if (fa[x] == x)
        return x;
    fa[x] = find(fa[x]);
    return fa[x];
}
void merge(int x, int y) {
    int fx = find(x), fy = find(y);
    if (fx != fy)
        fa[fy] = fx;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n * 2; i++) fa[i] = i;
    for (int i = 1; i <= m; i++) cin >> a[i].x >> a[i].y >> a[i].z;
    sort(a + 1, a + 1 + m, cmp);
    for (int i = 1; i <= m; i++) {
        if (find(a[i].x) == find(a[i].y)) {
            cout << a[i].z;
            return 0;
        }
        merge(a[i].x + n, a[i].y);
        merge(a[i].x, a[i].y + n);
    }
    cout << 0;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
char op;
map<string,string>p;
string find(string x)
{
    if(p[x] == x) return x; 
    p[x] = find(p[x]);
    return p[x];
}
string s,s1;
int main()
{
    cin >> op;
    while(op != '$')
    {
        cin >> s;
        if(op == '#')
        {
            s1 = s;
            if(p[s] == "") p[s] = s;
        }
        else if(op == '+') p[s]=s1;
        else cout << s << ' ' << find(s) << endl;    
        cin >> op;
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int n, m, s, t, father[1000001], ans;
int find(int x) {
    if (father[x] == x)
        return x;
    father[x] = find(father[x]);
    return father[x];
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) father[i] = i;
    for (int i = 1; i <= m; i++) {
        cin >> s >> t;
        int p = find(s), q = find(t);
        if (p != q)
            father[p] = q;
        else
            ans++;
    }
    cout << ans;
    return 0;
}

#include<bits/stdc++.h>
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
const int N=5000005;
int n,x[N],y[N],dist[N],cnt,head[N];
bool v[N];
struct node1{
	int to,nxt,w;
}edge[N];
void add(int u,int v,int w){
	++cnt;
	edge[cnt].to=v;
	edge[cnt].nxt=head[u];
	edge[cnt].w=w;
	head[u]=cnt;
}
struct node2{
	int x,y,id;
}a[N];
priority_queue<pair<int,int> > q;
void dijkstra(int s){
	memset(dist,0x3f,sizeof(dist));
	dist[s]=0;
	q.push(make_pair(0,s));
	while(!q.empty()){
		int t1=q.top().second;
		q.pop();
		v[t1]=1;
		for(int j=head[t1];j;j=edge[j].nxt){
			int t2=edge[j].to;
			if(!v[t2] and dist[t2]>dist[t1]+edge[j].w){
				dist[t2]=dist[t1]+edge[j].w;
				q.push(make_pair(-dist[t2],t2));
			}
		}
	}
}
bool cmp1(node2 a,node2 b){
	return a.x<b.x;	
} 
bool cmp2(node2 a,node2 b){
	return a.y<b.y;	
} 
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].x>>a[i].y;
		a[i].id=i;
	}
	sort(a+1,a+n+1,cmp1);
	for(int i=1;i<n;i++){
		add(a[i].id,a[i+1].id,a[i+1].x-a[i].x);
		add(a[i+1].id,a[i].id,a[i+1].x-a[i].x);
	}
	sort(a+1,a+n+1,cmp2);
	for(int i=1;i<n;i++){
		add(a[i].id,a[i+1].id,a[i+1].y-a[i].y);
		add(a[i+1].id,a[i].id,a[i+1].y-a[i].y);
	}
	dijkstra(1);
	cout<<dist[n];
	return 0;
}