#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define mp make_pair
using namespace std;
typedef long long int lli;
lli MOD = 1000000007;
int main()
{
    string n, m;
    cin >> n >> m;
    int a = n[n.size() - 1] - '0';
    int b = m[m.size() - 1] - '0';
    int ans = 1;
    rep(i, b)
    {
        ans *= a;
    }
    cout << ans % 10 << endl;
}