#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { string n, m; cin >> n >> m; if(m == "0"){ cout << 1 << endl; return 0; } int a = n[n.size() - 1] - '0'; int b = 0; rep(i,m.size()){ b *= 10; b += m[i] - '0'; b %= 4; } b = (b + 3) % 4; int ans = a; rep(i,b){ ans *= a; ans %= 10; } cout << ans << endl; return 0; }