def mod_of_large_number(m_str, T):
    if T == 4:
        if len(m_str) >= 2:
            last_part = m_str[-2:]
        else:
            last_part = m_str
        num = int(last_part)
        return num % 4
    elif T == 2:
        last_digit = m_str[-1]
        return int(last_digit) % 2
    else:
        return 0  # This case shouldn't occur as per our problem constraints

n = input().strip()
m = input().strip()

if not n or not m:
    print(1)
    exit()

d = int(n[-1])

if m == '0':
    print(1)
else:
    if d == 0:
        print(0)
    elif d == 1:
        print(1)
    elif d == 5:
        print(5)
    elif d == 6:
        print(6)
    else:
        if d in {2, 3, 7, 8}:
            T = 4
            mod_val = mod_of_large_number(m, T)
            exponent = mod_val if mod_val != 0 else T
        elif d in {4, 9}:
            T = 2
            mod_val = mod_of_large_number(m, T)
            exponent = mod_val if mod_val != 0 else T
        
        result = pow(d, exponent, 10)
        print(result)