There are representants from $n$ different countries sit around a circular table ($n\geq2$), in such way that if two representants are from the same country, then, their neighbors to the right are not from the same country. Find, for every $n$, the maximal number of people that can be sit around the table.
1. **Define the problem and notation:**
   We are given \( n \) different countries, and we need to find the maximal number of representatives that can sit around a circular table such that no two representatives from the same country have their neighbors to the right from the same country. Denote the countries by \( C_1, C_2, \ldots, C_n \). Let \( n_k \) be the number of representatives from country \( C_k \). The total number of representatives is \( N = \sum_{k=1}^n n_k \).

2. **Base case for induction:**
   For \( n = 2 \), we need to show that the maximal number of representatives is \( 2^2 = 4 \). Consider the representatives \( r_1 \) and \( r_2 \) from countries \( C_1 \) and \( C_2 \) respectively. A valid arrangement is \( (r_1, r_2, r_1, r_2) \). This satisfies the condition that no two representatives from the same country have their neighbors to the right from the same country.

3. **Inductive hypothesis:**
   Assume that for \( n \) countries, the maximal number of representatives that can sit around the table is \( n^2 \). This means we have a valid arrangement \( (a_1, a_2, \ldots, a_{n^2}) \) where each country \( C_k \) has exactly \( n \) representatives.

4. **Inductive step:**
   We need to show that for \( n+1 \) countries, the maximal number of representatives is \( (n+1)^2 \). Consider the valid arrangement for \( n \) countries. Each country \( C_k \) has \( n \) representatives, and the total number of representatives is \( n^2 \).

5. **Constructing the arrangement for \( n+1 \) countries:**
   Introduce representatives from the new country \( C_{n+1} \). We need to place these representatives in such a way that the condition is still satisfied. Replace each pair \( (r_k, r_k) \) in the original arrangement as follows:
   - For \( k = 1 \), replace \( (r_1, r_1) \) with \( (r_1, r_{n+1}, r_{n+1}, r_1, r_1) \).
   - For \( k \ge 2 \), replace \( (r_k, r_k) \) with \( (r_k, r_{n+1}, r_k, r_k) \).

6. **Verify the new arrangement:**
   The new arrangement has \( n^2 + 3 + 2(n-1) = (n+1)^2 \) representatives. This is because we added 3 representatives for the first pair and 2 representatives for each of the remaining \( n-1 \) pairs. The new arrangement satisfies the condition that no two representatives from the same country have their neighbors to the right from the same country.

7. **Conclusion:**
   By induction, we have shown that for every \( n \), the maximal number of representatives that can sit around the table is \( n^2 \).

\(\blacksquare\)

The final answer is \( \boxed{ n^2 } \)