Long ago, in a distant galaxy, before anyone knew about Harry Potter or The Lord of the Rings, hordes of inhabitants lived on a distant planet. Their technology was so advanced that they invented a time machine and traveled to the future, to the planet "Earth," where one of them happened upon a collection of cartoons. These cartoons amazed the researchers so much that they undertook a daring mission to acquire the complete collection of episodes. They brought these episodes back to their home planet, where they became extremely popular. Unfortunately, the cartoons were protected by a copy protection system, and the inhabitants, being inherently law-abiding, could not adapt to hacking. Therefore, they had to exchange the disks they brought from Earth with one another.
The local pop star, Grumpox, was upset by the popularity of something he had no part in and decided to restore things to the way they were. To do this, Grumpox wants to divide the inhabitants into two groups that do not communicate with each other. To break the connection between a pair of inhabitants, Grumpox needs to expend 1 unit of effort. However, Grumpox is extremely lazy and wants to spend the minimum effort necessary to achieve his goal. Help him.
The first line contains two integers (1 \leq N \leq 100) and — the number of inhabitants and the number of pairs of inhabitants exchanging cartoons. Each of the next lines contains two integers and , indicating that inhabitant and inhabitant know each other and exchange cartoons.
Output a single integer — the minimum number of units of effort that Grumpox needs to expend to achieve his goal.
Example 1