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.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;


public class Solution {
    
    public static int modulo(int a, char b[])
    {
        int mod = 0;
    
        for(int i=0; i<b.length; i++)
            mod = (mod*10 + b[i] - '0')%a;
    
        return mod;
    }
    
    
	public static void main(String[] args) {
       
        Scanner in = new Scanner(System.in);
        
        long n = in.nextLong();
        
        if(n==0)
        {
            System.out.println("1");
            return;
        }
        
        char a[] = new char[]{'1','3','7','8'};
        
        String s = Long.toString(n);
        char b[] = s.toCharArray();
        
        int l1 = a.length;
        int l2 = b.length;
        
        if(l2==0 && b[0]=='0')
        {
             System.out.println("1");
            return;
        }
           
        
        int exp = (modulo(4,b)==0)? 4 : modulo(4,b);
        
        int res = (int)(Math.pow(a[l1 - 1] - '0', exp));
        
        System.out.println(res%10);
        
        
	}
}