Prime number n is given. The inverse number to i (1 ≤ i < n) is such number j that i * j = 1 (mod n). Its possible to prove that for each i exists only one inverse.
For all possible values of i find the inverse numbers.
One prime number n (2 ≤ n ≤
Print n - 1 numbers. The i-th printed number should be the inverse to i.
1 3 2 4