Matcom Online Grader
Faculty of Mathematics and Computer Science of University of Havana

In the popular board game One Night Werewolf, players are distributed randomly in the roles of villagers and Werewolves. The goal of the villagers is to decide together on one person to kill during the night -- hopefully they will kill a Werewolf. Werewolves pose as villagers in the hope that the person killed is a villager, not a Werewolf.

In the variation Uncertain Werewolf, only one Werewolf exists and the game consists of two phases. During the first phase the players are still uncertain about who they should vote to kill, so each of them chooses two other players as possible victims. After the first phase the Werewolf reveals himself, and then in the second phase each player has to decide which one of their two initial choices they will vote to kill. The Werewolf is the last one to decide between his two initial choices, doing so after all the other players have decided already.

The Werewolf then loses the game if he has more votes than anyone else. If there is a draw, the Werewolf wins.

You are given the votes of $N$ players after the first phase of the game. You should answer how many players could reveal themselves at this point as the Werewolf and still win the game if the other players chose their votes optimally to kill the Werewolf.

The first line contains an integer $N$ ($3 \leq N \leq 50$), the number of players in the game. Each of the following $N$ lines contains two integers, $a_i$ and $b_i$ ($1 \leq a_i, b_i \leq N$, $a_i \neq b_i$), the index of the players the i-th player decided to kill in the first voting phase. No player will try to kill himself.

Output a line with one integer representing the number of players that could win the game if they were the Werewolf and everyone played optimally.