#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    string s, t;
    cin >> s >> t;
    int ns = s.length(), nt = t.length();
    int n = 0, ten = 1;
    for(int i = 0; i < ns; ++i){
        n = (n * ten + (s[i] - '0')) % 6;
        ten = ten * 10 % 6;
    }
    if(n == 0)  cout << 4 << endl;
    else if(n == 1) cout << 2 << endl;
    else if(n == 3) cout << 5 << endl;
    else if(n == 4) cout << 7 << endl;
    else{
        if((t[nt - 1] - '0') % 2 == 1){
            if(n == 2)  cout << 8 << endl;
            else    cout << 1 << endl;
        }
        else{
            if(n == 2)  cout << 7 << endl;
            else    cout << 2 << endl;
        }
    }

    return 0;
}