Problem 1060. -- Leftmost Digit

HDU_1060: Leftmost Digit

Time Limit: 1000 MS  Memory Limit: 32 MB   64bit IO Format: %I64d
Submitted: 116  Accepted: 60
[Submit][Status][Web Board]

Description

Given a positive integer N, you should output the leftmost digit of N^N.

Input

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

Output

For each test case, you should output the leftmost digit of N^N.

Sample Input

2
3
4

Sample Output

2
2


HINT


In the first case, 3 * 3 * 3 = 27, so the leftmost digit is 2.
In the second case, 4 * 4 * 4 * 4 = 256, so the leftmost digit is 2.

[Submit][Status][Web Board]