In a football tournament with $n\geq 2$ teams each two played a match. For a won match the victor gets 2 points and for a draw each one gets 1 point. In the final results there weren’t two teams with equal amount of points. It turned out that because of a mistake each match that was written in the results as won was actually a draw and each one that was written as draw was actually won. In the new ranking there were also no two teams with the same amount of points. Find all n for which it is possible for the two rankings to be opposite of each other, that is the first team in the first ranking is actually the last one, the second team is pre-last and so on.
Problem
Source: XI International Festival of Young Mathematicians Sozopol 2022, Theme for 11-12 grade
Tags: combinatorics