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 https://codeforces.com/
 */
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);
    TaskA11 solver = new TaskA11();
    solver.solve(1, in, out);
    out.close();
  }

  static class TaskA11 {

    public void solve(int testNumber, Scanner in, PrintWriter out) {
      for (int i = 0; i < testNumber; i++) {
        int n = in.nextInt();
        switch (n % 4) {
          case 0:
            out.println(6);
            break;
          case 1:
            out.println(8);
            break;
          case 2:
            out.println(4);
            break;
          case 3:
            out.println(2);
            break;
        }
      }
    }

  }
}

