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 main(n):
    if n == 0:
        return 1

    d = {
        1: 8,
        2: 4,
        3: 2,
        0: 6
    }
    return d[n % 4]

if __name__ == "__main__":
    for e, line in enumerate(sys.stdin.readlines()):
        n = int(line.strip())

    # Proof by induction that sorting is that
    # same as solving this problem.
    print(main(n))
