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 Main {

	private Scanner in;

	public static void main(String[] args) {
		new Main().start();
	}

	private void start() {
		in = new Scanner(System.in);
		solve();
		in.close();
	}

	private void solve() {
		long n = in.nextLong() * 3;
		
		if (n == 0) {
			System.out.println("1");
		} else {
			n %= 4;
			if (n == 0) {
				n = 4;
			}
			System.out.println(((int)Math.pow(2, n)) % 10);
		}
	}

}