Island Connections

In a simulation of islands connected by bridges, each island is identified by an integer. Given a list of bridges, determine how many distinct groups of connected islands exist after all the bridges are built. Input: The first line contains an integer B (1 ≤ B ≤ 1000) representing the number of bridges. The next B lines each contain two integers a and b, indicating that there is a bridge connecting islands 'a' and 'b'. Output: Output a single integer representing the number of distinct island groups. Example: Input: 4 1 2 2 3 4 5 5 6 Output: 3