#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

vector<vector<int>> v = {
	{0,0},
	{1,1},
	{2,4,8,6},
	{3,9,7,1},
	{4,6},
	{5,5},
	{6,6},
	{7,9,3,1},
	{8,4,2,6},
	{9,1}
};

long long mypow(long long x, long long y, long long MOD){
	long long ret=1LL;
	while(y>0LL){
		if(y&1LL) ret = (ret * x) % MOD;
		x = (x*x) % MOD;
		y >>= 1LL;
	}
	return ret;
}

long long rem(string X, long long Y){
	long long b = 0;

	for(int i=0; i<X.size(); i++){
		b *= 10;
		b += X[i] - '0';
		b %= Y;
	}

	return b;
}


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

	if(M == "0"){
		cout << 1 << endl;
		return 0;
	}

	long long x = *N.rbegin() - '0';
	long long y = rem(M, v[x].size());
	y = y - 1 + v[x].size();
	y %= v[x].size();

	cerr << x << " " << y << endl;

	long long ans = v[x][y];

	cout << ans << endl;

	return 0;
}