#include <bits/stdc++.h>
using namespace std;

#define int long long

#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define fi first
#define se second
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))
typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
typedef pair<pint,int> P1;
typedef pair<int,pint> P2;
typedef pair<pint,pint>PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD=1000000007;
const ll INF=1e18;
int dx[]={0,0,1,-1};
int dy[]={-1,1,0,0};

string s="285714";
string N,K;


signed main(){
    cin.tie(0);
	ios::sync_with_stdio(false);
    cin>>N>>K;
    int sum=0;
    rep(i,0,N.size()){
        sum+=N[i]-'0';
    }
    sum%=3;
    int k=(K[K.size()-1]-'0')%2;
    int ans=((N.back()-'0')%2*3+sum*4)%6;
    if((K.back()-'0')%2){
        cout<<s[(ans+5)%6]<<"\n";
    }else{
        cout<<s[(ans*ans+5)%6]<<"\n";
    }
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    return 0;
}