SMO 2016 Problem 3

Let $n$ be a prime number. Show that there is a permutation $a_1,a_2,...,a_n$ of $1,2,...,n$ so that $a_1,a_1a_2,...,a_1a_2...a_n$ leave distinct remainders when divided by $n$