#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
#include <cassert>
#include <complex>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
const int inf = 1e8;


int main() {
    string n,k;
    cin>>n>>k;
    reverse(n.begin(),n.end());
    reverse(k.begin(),k.end());
    int r = 0;
    int ten = 1;
    for(int i=0;i<n.length();i++){
        int x = n[i]-'0';
        if(i==0)r = (r+x)%6;
        else{
            ten = (ten*10)%6;
            r = (r + ten*x)%6;
        }
    }
    if(r==0)cout<<4<<endl;
    else{
        if(r==1)cout<<2<<endl;
        else{
            if(r==3)cout<<5<<endl;
            else{
                if(r==4)cout<<7<<endl;
                else{
                    int x = k[0]-'0';
                    if(x%2==0){
                        if(r==2)cout<<7<<endl;
                        else cout<<2<<endl;
                    }
                    else{
                        if(r==2)cout<<8<<endl;
                        else cout<<1<<endl;
                    }
                }
            }
        }
    }
}