Problem about GCD

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

Input contains multiple tests, one test per line. Last line contains -1, it should be skipped. [b][Technical Specification][/b] m <= 10^18

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