#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <algorithm>
#include <cmath>

#include <string>
#include <list>
#include <queue>
#include <vector>
#include <complex>

/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) std::cout<<(p)<<std::endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

int main(void){
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(6);//
	
	string A,B;
	cin>>A>>B;
	int N,M;
	N = A[A.size()-1]-'0';
	int Bsize = B.size();
	int e[4] = {2,4,8,6};
	int o[4] = {3,9,7,1};
	if(Bsize == 1){
		M = B[0]-'0';
		if(M == 0){
			P(1);
		}
		else{
			if(N==0 || N==1 || N==5){
				P(N);
			}
			else if(N%2==0){
				for(int i=0;i<4;++i){
					if(N==e[i]){
						P(e[(M+3+i)%4]);
						break;
					}	
				}
				
			}else{
				for(int i=0;i<4;++i){
					if(N==o[i]){
						P(o[(M+3+i)%4]);
						break;
					}
				}
			}
		}
	}else if(Bsize == 2){
		M = (B[Bsize-2]-'0')*10+B[Bsize-1]-'0';
////////
		if(N==0 || N==1 || N==5){
			P(N);
		}
		else if(N%2==0){
			for(int i=0;i<4;++i){
				if(N==e[i]){
					P(e[(M+3+i)%4]);
					break;
				}	
			}
			
		}else{
			for(int i=0;i<4;++i){
				if(N==o[i]){
					P(o[(M+3+i)%4]);
					break;
				}
			}
		}
/////////////
	}
	else{
		M = (B[Bsize-2]-'0')*10+B[Bsize-1]-'0';
		if(N==0 || N==1 || N==5){
			P(N);
		}
		else if(N%2==0){
			for(int i=0;i<4;++i){
				if(N==e[i]){
					P(e[(M+3+i)%4]);
					break;
				}	
			}
			
		}else{
			for(int i=0;i<4;++i){
				if(N==o[i]){
					P(o[(M+3+i)%4]);
					break;
				}
			}
		}
	}


	return 0;
}