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

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Bisoye
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        AArpasHardExamAndMehrdadsNaiveCheat solver = new AArpasHardExamAndMehrdadsNaiveCheat();
        solver.solve(1, in, out);
        out.close();
    }

    static class AArpasHardExamAndMehrdadsNaiveCheat {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            out.println(power(8, n, 10));
        }

        int power(int base, int exp, int mod) {
            int res = 1;
            while (exp > 0) {
                if (exp % 2 == 1) {
                    res = (res * base) % mod;
                    exp--;
                } else {
                    base = (base * base) % mod;
                    exp /= 2;
                }
            }
            return res;
        }

    }
}

