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 codeF_ModMultip {
	
	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		long n = sc.nextInt();
		sc.close();
		
		int a = 8;
		int p =10;
		
		long res = 1;
		
		while(n!=0) {
			if(n%2!=0) {
				res = (res * a)%p;
				n--;
			}
			else {
				a = (a*a)%p;
				n = n/2;
			}
		}
		
		System.out.println(res);
	}

}
