{var%20f='http://v.t.sina.com.cn/share/share.php?appkey=1515056452',u=z||d.location,p=['&url=',e(u),'&title=',e(t||d.title),'&source=',e(r),'&sourceUrl=',e(l),'&content=',c||'gb2312','&pic=',e(p||'')].join('');function%20a(){if(!window.open([f,p].join(''),'mb',['toolbar=0,status=0,resizable=1,width=440,height=430,left=',(s.width-440)/2,',top=',(s.height-430)/2].join('')))u.href=[f,p].join('');};if(/Firefox/.test(navigator.userAgent))setTimeout(a,0);else%20a();})(screen,document,encodeURIComponent,'','','https://www.xiaopingtou.cn//data/attach/topic/topicKPo7gB.jpg', '推荐 x292724z 的文章《hdu 1061 Rightmost Digit》','https://www.xiaopingtou.net/article-56764.html','页面编码gb2312|utf-8默认gb2312'));){kind=link}
//模幂运算，而且求个位，一直求10的模
# include
# include
# include
using namespace std;
__int64 Pow(__int64 m,__int64 n)
{
__int64 p=1;
while(n)
{
if(n%2)
p=p*m%10;
n/=2;
m=m*m%10;
}
return p%10;
}
int main()
{
int t;
__int64 n,m;
while(~scanf("%d",&t))
{
while(t--)
{
scanf("%I64d",&n);
m=n;
m%=10;//求个位的n次取模
if(m==0)
printf("0
");
else
printf("%I64d
",Pow(m,n));
}
}
return 0;
}