#include <bits/stdc++.h>

#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;

const ll MOD = 10;

int main() {
    string N, M;
    cin >> N;
    cin >> M;
    int n = N[N.size()-1] - '0';
    if (M == "0") {
        cout << 1 << endl;
        return 0;
    }
    int m = 0;
    if (M.size() >= 2) {
        m = (M[M.size()-1] - '0') + 10 * (M[M.size()-2] - '0');
    } else {
        m = (M[M.size()-1] - '0');
    }
    if (n == 0 || n == 1 || n == 5 || n == 6) {
        cout << n << endl;
    } else if (n == 2) {
        switch (m%4) {
            case 0:
                cout << 6 << endl;
                break;
            case 1:
                cout << 2 << endl;
                break;
            case 2:
                cout << 4 << endl;
                break;
            case 3:
                cout << 8 << endl;
                break;
        }
    } else if (n == 3) {
        switch (m%4) {
            case 0:
                cout << 1 << endl;
                break;
            case 1:
                cout << 3 << endl;
                break;
            case 2:
                cout << 9 << endl;
                break;
            case 3:
                cout << 7 << endl;
                break;
        }
    } else if (n == 7) {
        switch (m%4) {
            case 0:
                cout << 1 << endl;
                break;
            case 1:
                cout << 7 << endl;
                break;
            case 2:
                cout << 9 << endl;
                break;
            case 3:
                cout << 3 << endl;
                break;
        }
    } else if (n == 8) {
        switch (m%4) {
            case 0:
                cout << 6 << endl;
                break;
            case 1:
                cout << 8 << endl;
                break;
            case 2:
                cout << 4 << endl;
                break;
            case 3:
                cout << 2 << endl;
                break;
        }
    } else if (n == 4) {
        switch (m%2) {
            case 0:
                cout << 6 << endl;
                break;
            case 1:
                cout << 4 << endl;
                break;
        }
    } else if (n == 9) {
        switch (m%2) {
            case 0:
                cout << 1 << endl;
                break;
            case 1:
                cout << 9 << endl;
                break;
        }
    }
    return 0;
}