During a tournament, there are n teams ranked from $1$ to n, where $1$ is the strongest team and n is the weakest team.

The tournament matches are arranged in rounds. In each round, the strongest remaining team is paired with the weakest remaining team, the second strongest is paired with the second weakest, and so on. Every pair is formatted as (strongest,weakest).

This pairing process repeats round by round until only a single final match remains.

Given the integer n, return the tournament match structure as a string.

Constraints:

• n $= 2^x$ where x is in the range $[1, 12]$

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.