## Description:

Mr Chen wants some students to help him with a project. Because the project is rather complex, the more students come, the better it will be. Of course there are certain requirements.

Mr Chen selected a room big enough to hold the students. The student who are not been chosen has to leave the room immediately.There are 10000000 boys in the room numbered from 1 to 10000000 at the very beginning. After Mr Chen's selection any two of them who are still in this room should be friends (direct or indirect), or there is only one student left. Given all the direct friend-pairs, you should decide the best way.

## Input:

The first line of the input contains an integer n (0 ≤ n ≤ 100,000) - the number of direct friend-pairs. The following n lines each contains a pair of numbers A and B separated by a single space that suggests A and B are direct friends. (A ≠ B, 1 ≤ A, B ≤ 10000000)

## Output:

The output in one line contains exactly one integer equals to the maximum number of boys Mr Wang may keep.
## Sample Input:

4

1 2

3 4

5 6

1 6

4

1 2

3 4

5 6

7 8

## Sample Output:

4

2

## Note:

本题由旧版NOJ导入，来源：ACM爱好者协会