#include <bits/stdc++.h>
#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<int,int> 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';

    if(a == 0 || a == 1 || a == 5){
        cout << a << endl;
        return 0;
    }

    int b = 0;
    rep(i,m.size()){
        b *= 10;
        b += m[i] - '0';
        b %= 4;
    }

    int even[4] = {6,2,4,8};
    int odd[4] = {1,3,9,7};

    if(a % 2 == 0){
        if(a == 4)b += 1;
        if(a == 8)b += 2;
        if(a == 6)b += 3;
        b %= 4;
        cout << even[b] << endl;
    }else{
        if(a == 9)b += 1;
        if(a == 7)b += 2;
        if(a == 1)b += 3;
        b %= 4;
        cout << odd[b] << endl;
    }

    return 0;
}