Problem Description

Given integer m. Find multiplication of all 1<=a<=m such gcd(a, m)=1 (coprime with m) modulo m.

Input

Input contains multiple tests, one test per line.
Last line contains -1, it should be skipped.

[Technical Specification]
m <= 10^18

Output

For each test please output result. One case per line. Less than 160 test cases.

1
2
3
4
5
-1

0
1
2
3
4