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

import sys 
def BigMod(a,p,m):
    if p == 0: return 1
    if (p%2):
        return ((a%m)*(BigMod(a, p-1, m)))
    else:
        c = BigMod(a, p/2, m)
        return ((c%m)*(c%m))%m 
B = 1378
P = int(input())
M = 10
if P == 0:
    print(1)
else:
    print(BigMod(B, P, M)%10)