#include <iostream>
#include <bitset>
#include <fstream>
#include <string>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
#include <cctype>
#include <list>
#include <limits>
//#include <boost/multiprecision/cpp_int.hpp>

const double EPS = (1e-10);


using namespace std;
using Int = long long;
//using namespace boost::multiprecision;

const Int MOD = 1000000007;

Int mod_pow(Int x, Int n) {
    Int res = 1;
    while(n > 0) {
        if(n & 1) res = (res * x) % MOD; //ビット演算(最下位ビットが1のとき)
        x = (x * x) % MOD;
        n >>= 1; //右シフト(n = n >> 1)
    }
    return res;
}


int main(){
    cin.tie(0);

    int a[] = {2, 8, 5, 7, 1, 4};

    string N; cin >> N;

    
    int amari = 0;
    for (int i = 0; i < N.length(); i++){
        amari *= 10;
        amari += (int)(N[i] - '0');
        amari %= 6;
    }
    
    string K; cin >> K;
    if (K.length() == 1 && K[0] == '0'){
        cout << 2 << endl;
        return 0;
    }
    if (amari != 2 && amari != 5){
        cout << a[(amari-1+6)%6] << endl;
        return 0;
    }

    int amari2 = 0;
    amari2 += (int)(K[K.length()-1] - '0');
    if (K.length() > 1) amari2 += (int)(K[K.length()-2] - '0')*10;
    amari2 %= 2;
    if (amari == 2){
        if (amari2 == 0) cout << a[3] << endl;
        else cout << a[1] << endl;
    }else{
        if (amari2 == 0) cout << a[0] << endl;
        else cout << a[4] << endl;
    }

}