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.io.*;
import java.util.*;

public class Solution {

	InputReader reader = new InputReader();

	public static void main(String[] args) {
		new Solution().run();
	}

	public void run() {
		System.out.println(lastDigit(reader.nextInt()));
	}

	private int lastDigit(int n) {
		if (n == 0) return 1;
		return lastDigitHelper(n, new HashMap<Integer, Integer>());
	}	

	private int lastDigitHelper(int n, Map<Integer, Integer> memo) {
		if (n == 1) return 8;
		if (memo.containsKey(n)) return memo.get(n);
		int a = (int) Math.sqrt(n);
		int b = n - a;

		int result = (lastDigitHelper(a, memo) * lastDigitHelper(b, memo)) % 10;
		memo.put(n, result);
		return result;
	}

	class InputReader {

		private StringTokenizer tokenizer;
		private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		String nextToken() {
			if (tokenizer == null || !tokenizer.hasMoreElements()) {
				try {
					tokenizer = new StringTokenizer(br.readLine());
				} catch(IOException e) { }
			}
			return tokenizer.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(nextToken());
		}
	}

}
