#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int) N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=(int) n;i--)
#define p(s) cout<<(s)<<endl
#define DEBUG(x,y) cout<<#x<<": "<<x<<" , "<<#y<<": "<<y<<endl;
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9;

int main(){
	string n,m;
	int a,b;
	cin>>n>>m;
	a=n.back()-'0';
	if(m.size()==1){
		b=stoi(m);
		if(b==0){
			cout<<"1"<<endl;
		}
	}
	else {
		b=10*(m[m.size()-2]-'0')+m[m.size()-1]-'0';
		printf("%d\n",((int)pow(a,b%4+4))%10);
	}
	return 0;
}