#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<fstream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

template < typename T >
void vprint(T &V){
	for(auto v : V){
    	cout << v << " ";
	}
	cout << endl;
}

ll ll_pow(ll a, ll n){
    ll ans = 1;
    FOR(i, 0, n){
        ans *= a;
        ans %= 10;
    }
    return ans;
}

// char to int
int ctoi(char c) {
	if (c >= '0' && c <= '9') {
		return c - '0';
	}
	return 0;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    string N, M;
    cin >> N >> M;

    if(M=="0"){
        p(1);
        return 0;
    }

    ll L = N.size();
    ll n = ctoi(N[L-1]);
    
    if(M.size()==1){
        ll m = stoi(M);
        ll ans = ll_pow(n, m) % 10;
        p(ans);
        return 0;
    }
    else{
        ll L = M.size();
        ll m = stoi(M.substr(L-2, 2));

        if(m==0){
            m+=4;
        }

        ll ans = ll_pow(n, m);
        p(ans);
    }
    
    return 0;
}