Problem Description
After the Ferries Wheel, many friends hope to receive the Misaki’s kiss again,so Misaki numbers them 1,2…N−1,N,if someone’s number is M and satisfied the GCD(N,M) equals to N XOR M,he will be kissed again.
Please help Misaki to find all M(1<=M<=N).
Note that:
GCD(a,b) means the greatest common divisor of a and b.
A XOR B means A exclusive or B
Input
There are multiple test cases.
For each testcase, contains a integets N(0
/***********************************......
阅读全文