#include<cstdio>
#include<cstring>
#include<algorithm>
#include <iostream>
using namespace std;
#define N 100000
long long n,m;
long long pow_(long long n,long long m)
{
    long long ans=1;
    while (m!=0)
    {
        if (m&1) ans*=n%10;
        n*=n%10;
        m>>=1;   //将m右移，快速幂算法不会的看PS；
    }
    return ans;
}

int main()
{
    while (cin>>n>>m)
    {
        long long m1=pow_(n,m);
        cout<<m1<<endl;
    }
}