#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int main(){
    string N,M;
    cin>>N>>M;
    long long int NN,MM,ans=1;
    NN=N[N.size()-1]-'0';
    if(M.size()==1)MM=M[0]-'0';
    else MM=/*((M[M.size()-2]-'0')*10)+*/(M[M.size()-1]-'0');
    for(int i=0;i<MM;i++)ans=ans*NN%10;
    printf("%d\n",ans);
    return 0;
}