def solve():
    N = input()
    M = input()

    if M == '0':
        return 1

    N_mod = int(N[-1])
    M0 = int(M[-2:]) + 100

    return pow(N_mod, M0, 10)


#==================================================
print(solve())