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 math
import random
def gcd(a,b):
    if b==0:
        return a
    else:
        return gcd(b, a%b)
def co_prime(s):
    while True:
        e = random.choice(range(10000000))
        x = gcd(e,s)
        if x==1:
           break
    return e
"""
def exgcd(a,b):
    if not a: return 0,1,b
    x,y,g=exgcd(b%a,a)
    return y-(b/a)*x,x,g
a,b,c=map(int,raw_input().split())
x,y,g=exgcd(a,b)
C=-c/g
"""
def quickmod(a,b,mod):
    res = 1
    while b>0:
        if(b&1):
            res=(res*a)%mod
        a=(a*a)%mod
        b>>=1
    return  res
a =input()
print quickmod(1378,a,10)



