Problem with a ridiculously long name but with a ridiculously short description

All of us hate loooooong descriptions, so here goes one short: Calculate (66n) mod 100 for the given n. Input First line of input contains T, the number of test cases (1 ≤ T ≤ 5000). Then, there are T lines, one for each case, containing n (1 ≤ n ≤ 101000). Output Print one line per case, the solution of (66n) mod 100. Sample Input 4 0 1 2 9999999999999999999999 Sample Output 1 66 56 36