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 countMaxSetBits(left, right):
    while (left | (left + 1)) <= right:
        left |= left + 1
    return left


# n=int(input())
# n,k=map(int,input().split())
# arr=list(map(int,input().split()))
#ls=list(map(int,input().split()))
#for i in range(m):
# for _ in range(int(input())):
#from collections import Counter
#from fractions import Fraction
#s=iter(input())
#from collections import deque
#for _ in range(int(input())):
#n,k=map(int,input().split())
#arr=list(map(int,input().split()))

n=int(input())
var=n%4
if n==0:
    print(1)
    exit()
if var==0:
    print(6)
if var==1:
    print(8)
if var==2:
    print(4)
if var==3:
    print(2)
