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 java.util.Scanner;

public class CodeForces {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        n %= 4;
        System.out.println(power(8, n) % 10);
    }

    private static long power(int base, int exp) {
        if (exp == 0) {
            return 1;
        }
        long n = (power(base, exp / 2)) % 1000000007;
        if (exp % 2 == 0) {
            return (n * n) % 1000000007;
        }
        return (base * n * n) % 1000000007;
    }
}
