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

//package com.codeforces.Round383;

import java.util.Scanner;

public class Div2A {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        int n = Integer.parseInt(scanner.nextLine());

        if (n == 0) {
            System.out.println(1);
        } else {
            if (n % 4 == 1) System.out.println(8);
            if (n % 4 == 2) System.out.println(4);
            if (n % 4 == 3) System.out.println(2);
            if (n % 4 == 0) System.out.println(6);
        }

        scanner.close();
    }
}
