#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

map<ll, ll> m;
ll mod[1010];

int main()
{
	ll N, M;
	cin >> N >> M;

	ll cnt = 0;
	for (int i = 0; i <= M; i++) {
		if (m[((ll)pow(N, i))%10])break;
		m[((ll)pow(N, i))%10] = 1;
		mod[cnt++] = ((ll)pow(N, i)) % 10;
	}
	cout << "cnt = " << cnt << endl;

	int ind;
	
	if (N % 2 == 0 && M % cnt == 0)
		ind = (M % cnt) + 1;
	else if (N % 2 == 0) {
		cnt++;
		ind = M % cnt;
	}

	cout << mod[M % cnt] << endl;
	
	return	0;
}