#include <bits/stdc++.h>
using namespace std;

const int MOD=10;
int pw(int n,int k){
  assert(k>=0);
  int res=1;
  while(k){
    if(k&1)(res*=n)%=MOD;
    (n*=n)%=MOD;
    k>>=1;
  }
  return res;
}

signed main(){
  string n,m;cin>>n>>m;
  int N=(int)(n.back()-'0'),M;
  M=(int)(m.back()-'0');
  if(m.size()>=2)M+=(int)(m[m.size()-2]-'0')*10;
  cout<<pw(N,M)<<endl;
}