RMO 2016 C4

There are $100$ countries participating in an olympiad. Suppose $n$ is a positive integers such that each of the $100$ countries is willing to communicate in exactly $n$ languages. If each set of $20$ countries can communicate in exactly one common language, and no language is common to all $100$ countries, what is the minimum possible value of $n$?