#include #define REP(i, x, n) for(int i = x; i < (int)(n); i++) #define rep(i, n) REP(i, 0, n) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define F first #define S second #define mp make_pair using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair P; int main() { // ios_base::sync_with_stdio(false); vector> v(10); rep(i, 10) { vector flg(10, false); int tmp = 1; while(1) { tmp *= i; if(flg[tmp % 10]) break; flg[tmp % 10] = true; v[i].push_back(tmp % 10); } } // rep(i, 10) { // rep(j, v[i].size()) { // cout << v[i][j] << ' '; // } // cout << endl; // } string N, M; cin >> N >> M; int n = N.back() - '0'; int m; if(v[n].size() == 1) m = 0; else if(v[n].size() == 2) { m = (M.back() - '0' + 1) % 2; } else { int sz = M.size(); if(sz > 1) { m = (10 * (M[sz - 2] - '0') + (M[sz - 1] - '0') + 3) % 4; } else { m = (M[sz - 1] - '0' + 3) % 4; } } if(M == "0") { n = 1; m = 0; } cout << v[n][m] << endl; return 0; }