There are n teams numbered from $0$ to $n - 1$ in a tournament.

You are given a two dimensional integer matrix grid of size $n imes n$. For any two distinct teams i and j, grid[i][j] == 1 denotes that team i is stronger than team j, whereas grid[i][j] == 0 denotes that team j is stronger than team i.

A team is the champion if there is no other team that is stronger than it.

Return the team that is the champion.

Constraints:

• n == grid.length

• n == grid[i].length

• $2 \leq$ n $\leq 100$

• grid[i][j] is either $0$ or $1$.

• For all i, grid[i][i] is $0$.

• For all i, j such that i != j, grid[i][j] != grid[j][i].

• The input is generated such that if team a is stronger than team b and team b is stronger than team c, then team a is stronger than team c.

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.