You are given an integer n, representing the initial number of teams participating in a tournament.

The tournament proceeds according to the following rules:

• If the current count of teams is even, each team is paired with another team. A total of $n / 2$ matches are played, and $n / 2$ teams advance to the next round.

• If the current count of teams is odd, one team randomly advances, and the remaining teams are paired. A total of $(n - 1) / 2$ matches are played, and $(n - 1) / 2 + 1$ teams advance to the next round.

Return the total count of matches played throughout the tournament until a single winner is determined.

Constraints:

• $1 \le n \le 200$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.