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;

/**
 * Created by Lenovo on 06-12-2016.
 */
public class a {
    public static void main(String args[]){
        Scanner in=new Scanner(System.in);
        int n=in.nextInt();
        System.out.println(func(8,n,10)%10);
    }
    public static int func(int x, int n,int d){
        if(n==0){
            return 1;
        }
        else if(n==1){
            return x%d;
        }
        else if(n%2==0){
            int a= func(x,n/2,d);
            a=a%d;
            return (a*a)%d;
        }
        else{
            int a=func(x,n/2,d);
            a=a%d;
            a=(a*a)%d;
            return (a*x)%d;
        }
    }
}
