#include <iostream>
#include <stdio.h>
#include <cstring>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <utility>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define LL long long
#define INF 100000000
#define mod 1000000007
using namespace std;
int keta(int n,int k){return (n/int(pow(10,double(k-1)))) % 10;} //nの下からk桁目
ll gcd(ll n,ll m){
	if(n<m){ll a=m;m=n;n=a;}
	ll r=n%m;
	while(r!=0){
		n=m;
		m=r;
		r=n%m;
	}
	return m;
}
ll lcm(ll n,ll m){
	return n*m/gcd(n,m);
}

int main(){
	char n[10010];
	char m[10010];

	cin>>n;
	cin>>m;
	int i=0;
	char n1;
	while(n[i]!='\0'){
		n1=n[i];
		i++;
	}
	double n2=int(n1)-48;
			
	int j=0;
	char m1='0',m2='0';
	while(m[j]!='\0'){
		m2=m1;
		m1=m[j];
		j++;
	}
	//cout<<m1<<" "<<m2<<endl;
	if(j==1 && m1=='0'){
		cout<<1<<endl;
		return 0;
	}
	int m3=int(m1)-48;
	int m4=int(m2)-48;
	int m5=(m4*10+m3)%4+4;
	//cout<<n2<<" "<<m5<<endl;
	cout<<int(pow(n2,double(m5)))%10<<endl;
	

}