import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


N = input()[:-1]
M = input()[:-1]

if M == '0':
    print(1)
    exit()

N = int(N[-1])
M = int(M[-2:]) if len(M) > 2 else int(M)

a = [(0,), (1,), (2, 4, 8, 6), (3, 9, 7, 1), (4, 6), (5,), (6,), (7, 9, 3, 1), (8, 4, 2, 6), (9, 1)]
print(a[N][M % len(a[N]) - 1])