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;
public class AryaExam{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int n = 1378;
		int p = sc.nextInt();
		int l = n % 10;

		if(p > 1){
			int arr[] = {4,4,2,1,1};

			int res = arr[(p - 2) % arr.length];

			int mod = p % res;
			System.out.println((int)Math.pow(l, mod) % 10);
		}
		else{//k
			System.out.println(l % 10);
		}
	}
}