time limit per test
1 second
memory limit per test
256 megabytes
Monocarp has three nephews. New Year is coming, and Monocarp has n candies that he will gift to his nephews.
To ensure that none of the nephews feels left out, Monokarp wants to give each of the three nephews the same number of candies.
Determine the minimum number of candies that Monocarp needs to buy additionally so that he can give each of the three nephews the same number of candies. Note that all n candies that Monocarp initially has will be given to the nephews.
Input
The first line contains an integer t (1≤t≤100) --- the number of test cases.
Each test case consists of one line containing one integer n (1≤n≤100) --- the number of candies that Monocarp initially has.
Output
For each test case, print one integer --- the minimum number of candies that Monocarp needs to buy additionally so that he can give each of the three nephews the same number of candies.
Example
Input
Copy
2
7
24
Output
Copy
2
0
Note
In the first example, Monocarp needs to buy 2 candies. After that, he will have 9 candies, and he can give each of the three nephews 3 candies.
In the second example, Monocarp does not need to buy any candies, as he initially has 24 candies, and he can give each of the three nephews 8 candies.
解题说明：水题，直接计算出差值即可。
cpp
#include <stdio.h>
int main()
{
int t;
scanf("%d", &t);
while (t--)
{
int n;
scanf("%d", &n);
if (n % 3 == 0)
{
printf("0\n");
}
else
{
printf("%d\n", 3 - n % 3);
}
}
return 0;
}