PROGRAMMING:Student allocation
After the fast and slow classes are divided well, the students in the fast class will assign the designated elder students to teach them in person. How to distribute is a big problem. The boring president has his own selection plan. Suppose that there are members numbered 1 to n-1, and the number of the president is n. there are n people in total. Members who have no common divisor (except 1) with the president's number will be accepted as the president's disciples. How many members will the president lead? Please program to help the president calculate it.
###Input format:
There is a number T in the first line representing the test data of group t (1 < T < = 10000), followed by a positive integer n (1 < n < 32768) representing the number of the president.
###Output format:
For each n, output the number of members the president will bring, and each number will occupy one line.
###Input example:
Here is a set of inputs. For example:
```in
two
one hundred
two hundred
```
###Output example:
The corresponding output is given here. For example:
```out
forty
eighty
```
answer：If there is no answer, please comment
###Input format:
There is a number T in the first line representing the test data of group t (1 < T < = 10000), followed by a positive integer n (1 < n < 32768) representing the number of the president.
###Output format:
For each n, output the number of members the president will bring, and each number will occupy one line.
###Input example:
Here is a set of inputs. For example:
```in
two
one hundred
two hundred
```
###Output example:
The corresponding output is given here. For example:
```out
forty
eighty
```
answer：If there is no answer, please comment