说明：  已知长度最大为200位的正整数n，请求出2011^n的后四位。输入第一行为一个正整数k，代表有k组数据，k<=200接下来的k行， 每行都有一个正整数n，n的位数<=200输出每一个n的结果为一个整数占一行，若不足4位，去除高位多余的0
(The known maximum length of 200 positive integer n, requesting the four 2011 ^ n after the. Enter the first acts of a positive integer k, representatives k sets of data, k <= 200 next k lines, Each row has a positive integer n, the number of bits n of <= 200 outputs the result of each n is an integer per line, if less than four, to remove excess high 0)