#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<functional>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<map>
using namespace std;
#define MOD 1000000007
#define f(i,n) for(int i=0;i<int(n);i++)
#define N 200000


int main(){
	char a[N + 1];
	int b[6];
	b[0] = 4;
	b[1] = 2;
	b[2] = 8;
	b[3] = 5;
	b[4] = 7;
	b[5] = 1;
	int n, k;
	int x, y, z;
	long long s, ans;
	bool v = true;
	ans = 0;
	f(i, N + 1)a[i] = 0;
	scanf("%s", a);
	n = strlen(a);
	s = 0;
	f(i, n){
		s += (a[i] - 48);
		s = s % 3;
	}
	if (s == 0){
		if ((a[n - 1] - 48)%2 == 0){
			x = 0;
		}
		else{
			x = 3;
		}
	}
	else if (s == 1){
		if ((a[n - 1] - 48) % 2 == 0){
			x = 4;
		}
		else{
			x = 1;
		}
	}
	else{
		if ((a[n - 1] - 48) % 2 == 0){
			x = 2;
		}
		else{
			x = 5;
		}
	}
	f(i, N + 1)a[i] = 0;
	scanf("%s", a);
	n = strlen(a);
	if (a[n - 1] % 2 == 0){
		if (x == 2)x = 4;
		else if (x == 5)x = 1;
	}

	printf("%d\n", b[x]);


	return 0;
}