HDU1061

Rightmost Digit

Problem Description

Given a positive integer N, you should output the most right 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 rightmost digit of N^N.

 

Sample Input

  
  

   
   2
3
4
  
  

 

Sample Output

  
  

   
   7
6


   
   

    
    

     
     Hint
    
    
In the first case, 3 * 3 * 3 = 27, so the rightmost digit is 7.
In the second case, 4 * 4 * 4 * 4 = 256, so the rightmost digit is 6.

   
   
   
   


   
   
   
   

    
    

     
     
//	HDU1061 基础题
//	Rightmost Digit http://acm.hdu.edu.cn/showproblem.php?pid=1061
//	2017.06.15 by wyj

#include
       
       
        
        
#include
        
        
         
         
using namespace std;

int main()
{
	int t;
	scanf("%d", &t);
	for (int j = 0;j < t;j++)
	{
		int n;
		int i = 0;
		int d = 1;
		scanf("%d", &n);
		int temp = n % 10;
		int k = n % 4;
		if (k == 0)
			k = 4;
		for (i = 0;i < k;i++)
		{
			d = (temp*d) % 10;
		}
		printf("%d\n", d);
	}

	return 0;
}