MEMO 2017 Problem 7

Determine all integers $n \geq 2$ such that there exists a permutation $x_0, x_1, \ldots, x_{n - 1}$ of the numbers $0, 1, \ldots, n - 1$ with the property that the $n$ numbers $$x_0, \hspace{0.3cm} x_0 + x_1, \hspace{0.3cm} \ldots, \hspace{0.3cm} x_0 + x_1 + \ldots + x_{n - 1}$$ are pairwise distinct modulo $n$ .