#include #include #include #include #include #include #include #include #include #include #include #include #include #pragma region using namespace std; #define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++) #define rep(i,n) FOR(i,0LL,n) #define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--) #define rrep(i,n) RFOR(i,0LL,n) #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #define COUNT(a,y,x) upper_bound(all(a), y) - lower_bound(all(a), x) #define UNIQUE(a) sort(all(a)); a.erase(unique(all(a)), a.end()) #define SUM(a) accumulate(all(a),0LL) #define pb push_back #define endl '\n' typedef long long int ll; typedef vector vll; typedef vector vvll; typedef pair pll; typedef vector vpll; typedef vector vs; typedef map MAP; const ll inf = 2222222222222222222LL; const ll mod = 1000000007LL; ll n = 0, m = 0, ans = 0, cnt = 0, tmp = 0, ma = -inf, mi = inf; string s; bool ok = true, flag = false; ll dx[5] = { 1,-1,0,0,0 }, dy[5] = { 0,0,1,-1,0 }; ll ddx[9] = { 1,-1,0,0,1,1,-1,-1,0 }, ddy[9] = { 0,0,1,-1,1,-1,1,-1,0 }; #pragma endregion #define MAX 222222 int main(void) { ios::sync_with_stdio(false); cin.tie(0); string s1, s2; cin >> s1; cin >> s2; ll a[111]; a[0] = 2; a[1] = 8; a[2] = 5; a[3] = 7; a[4] = 1; a[5] = 4; ll cur = 0; rep(i, s1.length()) { if (i != 0) (cur *= 10) %= 6; (cur += (s1[i] - '0')) %= 6; } n = cur % 6; ans = 1; rep(i, s2.length()) { tmp = ans; if(i!=0 ) rep(j,10) (ans *= tmp) %= 6; rep(j, s2[i] - '0') (ans *= n) %= 6; } (ans += 5) %= 6; cout << a[ans] << endl; return 0; }