#include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <climits>

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
using namespace std;
typedef pair<int ,int > P;
typedef long long ll;

string div(const string &s) {
    if(s=="1") return "0";
    string ret;
    int n=0;
    rep(i,s.size()) {
        n*=10;
        n+=s[i]-'0';
        if(n>1) {
            ret+=string(1, n/2+'0');
            n=n%2;
        }
    }

    return ret;
}

string to_bin(const string &s) {
    string num=s;
    string ret;
    int n=0;
    while(num!="0") {
        int t=num.back() - '0';
        if(t&1) ret+="1";
        else ret+="0";
        num=div(num);
    }

    reverse(all(ret));
    return ret;
}

int main() {
    string N,M;
    cin>>N>>M;
    int a=N.back()-'0';
    string B=to_bin(M);
    int ans=1;
    rep(i,B.size()) {
        int t=B[B.size()-1-i]-'0';
        if(t==1) {
            ans*=a;
            ans%=10;
        }
        a*=a;
        a%=10;
    }
    cout<<ans<<endl;
    
    return 0;
}