#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define all(x) (x).begin(),(x).end() #define rep(i,m,n) for(int i = m;i < n;++i) #define pb push_back #define fore(i,a) for(auto &i:a) #define rrep(i,m,n) for(int i = m;i >= n;--i) #define INF INT_MAX/2 using namespace std; using ll = long long; using R = double; const ll MOD = 1e9 + 7; const ll inf = 1LL << 50; struct edge { ll from; ll to; ll cost; }; int main(){ string n, m; cin >> n >> m; reverse(all(m)); reverse(all(n)); if (m == "0") { cout << 1 << endl; return 0; } int c; if (m.size() == 1) { c = (m[0] - '0'); } else { c = (m[1] - '0') * 10 + (m[0] - '0'); } c %= 4; int e = n[0] - '0'; int tmp = e; if (c == 0) { rep(i, 0, 3) { e *= tmp; } } else { rep(i, 0, c - 1) { e *= tmp; } } cout << e % 10 << endl; return 0; }