#P1524. A magical problem of number theory
A magical problem of number theory
题目描述
Given a positive integer , you should output the most right digit of .
输入格式
The input contains several test cases. The first line of the input is a single integer which is the number of test cases. test cases follow. Each test case contains a single positive integer
().
输出格式
For each test case, you should output the rightmost digit of .
样例
2
3
4
7
6
提示
In the first case, = 27, so the rightmost digit is 7.
In the second case, = 256, so the rightmost digit is 6.
By ZenF1sh of QLU