Hdu-1061-rightmost Digit (Quick power modulo!) ）

Rightmost DigitTime limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)
Total submission (s): 34329 Accepted Submission (s): 13091


Problem Descriptiongiven A positive integer N, you should output the most right digit of n^n.

Inputthe input contains several test cases. The first line of the input was a single integer T which is the number of test cases. T test Cases follow.
Each test case is contains a single positive integer N (1<=n<=1,000,000,000).

Outputfor Each test case, you should output the rightmost digit of n^n.

Sample Input

234

Sample Output

HintIn the first case, 3 * 3 * 3 = rightmost, so the digit is 7.In the second case, 4 * 4 * 4 * 4 = The rightmost digit is 6.

Authorignatius.l

Quick power modulo, no explanation!

AC Code:

Hdu-1061-rightmost Digit (Quick power modulo!) ）