#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(a);i>(b);--i)
#define eper(i,a,b) for(int i=(a);i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF 100100100100
#define inf 9001001001
#define MOD 1000000007
#define ALL(x) begin(x),end(x)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using vii = vector<int>;
using vll = vector<ll>;
template<class T>using vv = vector<T>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}

string n, k;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
    cin >> n >> k;
    int n_mod6 = 0, k_mod2 = 0, p = 0;
    rep(i, 0, n.size()) {
      n_mod6 = (n_mod6 * 10 + (n[i] - '0')) % 6;
    }
    k_mod2 = (k[(int)k.size()-1] - '0') % 2;
    if (k_mod2 == 0) k_mod2 = 2;
    int ans = 1;
    while (k_mod2 > 0) ans *= n_mod6, ans %= 6, k_mod2--;
    string s = "285714";
    ans += 5;
    cout << s[ans % 6] << endl;
    return 0;
}