You are given an integer n, the number of teams in a tournament that has strange rules:


	If the current number of teams is even, each team gets paired with another team. A total of n / 2 matches are played, and n / 2 teams advance to the next round.
	If the current number of teams is odd, one team randomly advances in the tournament, and the rest gets paired. A total of (n - 1) / 2 matches are played, and (n - 1) / 2 + 1 teams advance to the next round.


Return the number of matches played in the tournament until a winner is decided.

&nbsp;
Example 1:

Input: n = 7
Output: 6
Explanation: Details of the tournament: 
- 1st Round: Teams = 7, Matches = 3, and 4 teams advance.
- 2nd Round: Teams = 4, Matches = 2, and 2 teams advance.
- 3rd Round: Teams = 2, Matches = 1, and 1 team is declared the winner.
Total number of matches = 3 + 2 + 1 = 6.


Example 2:

Input: n = 14
Output: 13
Explanation: Details of the tournament:
- 1st Round: Teams = 14, Matches = 7, and 7 teams advance.
- 2nd Round: Teams = 7, Matches = 3, and 4 teams advance.
- 3rd Round: Teams = 4, Matches = 2, and 2 teams advance.
- 4th Round: Teams = 2, Matches = 1, and 1 team is declared the winner.
Total number of matches = 7 + 3 + 2 + 1 = 13.


&nbsp;
Constraints:


	1 &lt;= n &lt;= 200


class Solution:
	def numberOfMatches(self, n: int) -> int:
		return n - 1
class Solution {
    public int numberOfMatches(int n) {
		// This is the problem's base case; we know that if n == 1,
		// the number of matches played must be 0, since the last team left
		// can't play a match against themselves.
        if (n == 1) return 0;
        
		// We declare an int to hold our recursive solution.
        int res;
		
		// We initialize res using a recursive call, reducing n 
		// as described in the problem.
        if (n % 2 == 0) {
            res = numberOfMatches(n / 2);
			// After the recursive call is executed, we add the appropriate value to 
			// our solution variable.
            res += n / 2;
        }
        else {
            res = numberOfMatches((n - 1) / 2 + 1);
            res += (n - 1) / 2;
        }
        
		// Our initial call to numberOfMatches()
		// will return the total number of matches 
		// added to res in each recursive call.
        return res;
    }
}
class Solution {
public:
    int numberOfMatches(int n) {
        int count=0;
        while(n>1)
        { 
            if(n%2==0)
            {
           int a=n/2;
           n=n/2;
           count=count+a;}
           else
           {
               int a=(n-1)/2;
               n=a+1;
               count=count+a;
           }            
        }
        return count;
    }
};
/**
 * @param {number} n
 * @return {number}
 */
var numberOfMatches = function(n) {
    let matches = 0,current = n;
    while(current > 1){
        if(current % 2 === 0){
            matches += current/2;
            current = current/2
        }else{
            matches += (current-1)/2;
            current = (current-1)/2 + 1 ;
        }
    }
    return matches;
};
Count of Matches in Tournament