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;

import static java.lang.Math.*;
import static java.util.Arrays.sort;


public class Main {
    static Scanner in = new Scanner(System.in);

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        long N = in.nextLong();
        int a = (int) N % 4;
        if (N != 0) {
            switch (a) {
                case 1: {
                    System.out.println(8);
                    break;
                }
                case 2: {
                    System.out.println(4);
                    break;
                }
                case 3: {
                    System.out.println(2);
                    break;
                }
                case 0: {
                    System.out.println(6);
                    break;
                }
            }
        } else {
            System.out.println(1);
        }
    }
}

class Stack<T> {
    private int maxSize;
    private Object[] stackArray;
    private int top;

    public Stack(int s) {
        maxSize = s;
        stackArray = new Object[maxSize];
        top = -1;
    }

    public void push(T v) {
        top++;
        stackArray[top] = v;
    }

    public T pop() {
        top--;
        return (T) stackArray[top + 1];
    }

    public T peek() {
        return (T) stackArray[top];
    }

    public boolean empty() {
        if (top == -1) return true;
        return false;
    }

    public boolean full() {
        if (top == maxSize - 1) return true;
        return false;
    }

    public void clear() {
        top = -1;
    }
}



