#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9,MOD = 1e9+7,ohara = 1e6;
const ll LINF = 1e18;
using namespace std;

#define rep(i,n) for(ll (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(ll i=(a);i<(b);i++)
#define rrrep(i,a,b) for(ll i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl

ll cnt=0,ans=0,a,b,c,d,cmp,cmpp,m,h,w,x,y,sum=0,pos;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
//int dy[]={-1,0,1,-1,1,-1,0,1};
//int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"),n,k;
bool fl;
struct edge{int to,cost;};

//-------------------------↓↓↓↓↓↓------------------------

int main(void){
       cin.tie(0);
    ios::sync_with_stdio(false);
      
    cin>>n>>k;
    ll lim=Size(n);
    while(1){
        if(lim-cnt==0)break;
        while(n[cnt]=='0'){
            cnt++;
        }
        pos=n[cnt]-'0';
        if(pos>=6){
            pos=pos%6;
            string co;
            co=to_string(pos);
            n[cnt]=co[0];
        }
        else{
            cmp=pos*10;
            pos=n[cnt+1]-'0';
            cmp=cmp+pos;
            //cout<<pos<<"\n";
            cmp=cmp%6;
            string co;
            co=to_string(cmp);
            //cout<<"co"<<" "<<co<<"\n";
            n[cnt+1]=co[0];
            cnt++;
        }
    }
    pos=n[Size(n)-1]-'0';
    pos=pos%6;
    //cout<<pos<<"\n";
    if(pos%6==0){
        cout<<"4\n";
    }
    else if(pos%6==1){
        cout<<"2\n";
    }
    else if(pos%6==2){
        pos=k[Size(k)-1]-'0';
        if(pos%2==1)cout<<"8\n";
        else cout<<"7\n";
    }
    else if(pos%6==3){
        cout<<"5\n";
    }
    else if(pos%6==4){
        cout<<"7\n";
    }
    else if(pos%6==5){
        pos=k[Size(k)-1]-'0';
        if(pos%2==1)cout<<"1\n";
        else cout<<"2\n";
    }
    return 0;
}