#include <stdio.h>
#include <algorithm>
using namespace std;

int main()
{
	int T,N[30000],i,j,ucif=0,a,f;
	freopen("cifra.in","r",stdin);
	freopen("cifra.out","w",stdout);
	scanf("%i ",&T);
	for(i=0;i<T;i++)
		scanf("%i ",&N[i]);
	sort(N,N+T);
	f=0;
	for(i=1;i<=N[T-1];i++)
	{
		a=1;
		for(j=1;j<=i;j++){	a*=i; a%=10; }
		ucif+=a;
		ucif%=10;
		if(i==N[f])
		{	printf("%i\n",ucif); f++; }
	}
	return 0;
}