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

/**
 * @author pvasilyev
 * @since 12/6/16
 */
public class A {

    public static void main(String[] args) {
        final Scanner reader = new Scanner(System.in);
        final PrintWriter writer = new PrintWriter(System.out);

        solve(reader, writer);

        reader.close();
        writer.close();
    }

    private static void solve(final Scanner reader, final PrintWriter writer) {
        final long n = reader.nextLong();
        if (n == 0) {
            writer.println("1");
        } else if (n == 1) {
            writer.println("8");
        } else {
            writer.println(quickexp(n));
        }
    }

    private static long quickexp(final long n) {
        if (n == 0) {
            return 1;
        } else if (n == 1) {
            return 8;
        } else {
            long quickexp = quickexp(n / 2) % 10;
            if (n % 2 == 0) {
                return (quickexp * quickexp) % 10;
            } else {
                return ((quickexp * quickexp * 8) % 10);
            }
        }
    }

}
