#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <tuple>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

string n, m;

int solve() {
    int a = (int)(n[n.size()-1] - '0');
    int b = 0;
    if (m.size() < 5) {
        for (int i = 0; i < m.size(); i++)
            b = 10 * b + (m[i]-'0');
    } else {
        int c = 0, d = a;
        do {
            d *= a;
            d %= 10;
            c++;
        } while (d != a);
        for (int i = 0; i < m.size(); i++) {
            b = 10 * b + (m[i]-'0');
            b %= c;
        }
        if (b == 0) b = c;
    }
    int res = 1;
    for (int i = 0; i < b; i++) {
        res *= a;
        res %= 10;
    }
    return res;
}

void input() {
    cin >> n >> m;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    cout << solve() << endl;
}