Question
Rescue Camp Regions

After heavy rain, a district sets up N rescue camps. Some pairs of camps are connected by usable roads. Two camps belong to the same rescue region if a volunteer can travel from one to the other using one or more usable roads.

Your task is to count how many separate rescue regions exist.

Input

The first line contains two integers KaTeX can only parse string typed expression and KaTeX can only parse string typed expression — the number of camps and usable roads.

Each of the next KaTeX can only parse string typed expression lines contains two integers KaTeX can only parse string typed expression and KaTeX can only parse string typed expression, meaning camp KaTeX can only parse string typed expression and camp KaTeX can only parse string typed expression are connected by a two-way road.

Output

Print a single integer — the number of separate rescue regions.

Example
Example 1:
Input
5 3

1 2
2 3
4 5
Output
2
Explanation
Camps KaTeX can only parse string typed expression form one region and camps KaTeX can only parse string typed expression form another region.

Example 2:
Input
4 0
Output
4
Explanation
There are no roads, so every camp is its own rescue region.

Online