Codeforces 217A. Ice Skating 【并查集】

A. Ice Skating

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Bajtek is learning to skate on ice. He's a beginner, so his only mode of transportation is pushing off from a snow drift to the north, east, south or west and sliding until he lands in another snow drift. He has noticed that in this way it's impossible to get from some snow drifts to some other by any sequence of moves. He now wants to heap up some additional snow drifts, so that he can get from any snow drift to any other one. He asked you to find the minimal number of snow drifts that need to be created.

We assume that Bajtek can only heap up snow drifts at integer coordinates.

Input

The first line of input contains a single integer n (1 ≤ n ≤ 100) — the number of snow drifts. Each of the following n lines contains two integers xi and yi (1 ≤ xi, yi ≤ 1000) — the coordinates of the i-th snow drift.

Note that the north direction coinсides with the direction of Oy axis, so the east direction coinсides with the direction of the Ox axis. All snow drift's locations are distinct.

Output

Output the minimal number of snow drifts that need to be created in order for Bajtek to be able to reach any snow drift from any other one.

Examples

input

2
2 1
1 2

output

1

input

2
2 1
4 1

output

0

/*
    题意：给出n个点的坐标,如果两个点x相同或者y相同,则两点可以联通,
          问你最少加几条线,能使全部点联通
    类型：并查集
    分析：属于裸并查集了吧..
*/

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int n;
int fa[1005];
struct Node{
    int x,y;
};
Node a[1005];
int Find(int x){
    if(fa[x]==x)return x;
    return fa[x]=Find(fa[x]);
}
void unite(int x,int y){
    x=Find(x);
    y=Find(y);
    if(x!=y)fa[x]=y;
}
int main()
{
    while(~scanf("%d",&n)){
        for(int i=0;i<=n;i++)fa[i]=i;
        for(int i=0;i<n;i++)
            scanf("%d%d",&a[i].x,&a[i].y);
        for(int i=0;i<n;i++)
           for(int j=0;j<n;j++){
              if(a[j].x==a[i].x||a[j].y==a[i].y){
                  unite(i,j);
              }
           }
        int res=0;
        for(int i=0;i<n;i++){
            if(fa[i]==i)res++;
        }
        printf("%d\n",res-1);
    }
    return 0;
}