12
 1378
 51202278
 989898989
 4
 7
 9
 6
 8
 12193721
 999999995
 999999999
 11
 999999996
 999999998
 3
 14
 15
 10
 999999994
 1000
 13781378
 5
 999999997
 1000000000
 13
 16
 0

6
 4
 4
 8
 6
 2
 8
 4
 6
 8
 2
 2
 2
 6
 4
 2
 4
 2
 4
 4
 6
 4
 8
 8
 6
 8
 6
 1

def solution(a):
    if a % 4 == 0:
        print(6)
    elif a % 4 == 1:
        print(8)
    elif a % 4 == 2:
        print(4)
    else:
        print(2)


n = input()
if len(n) == 1:
    n = int(n[-1])
    if n == 0:
        print(1)
    else:
        solution(n)
else:
    n = int(n[-1]) + 10 * int(n[-2])
    solution(n)
