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.*;
public class Solution {
	public static void main(String[] args) {
		// TODO Auto-generated method stub
        //System.out.println("");
			
		Scanner o=new Scanner(System.in);
	
		
		long base=1378;
		
	   long n=o.nextLong();
	   
	   
	  long res=(long) Math.pow(base, n);
		
	  if(res%2 !=0)
	  {
		  System.out.println((res-1)%10);
	  }
	  else
	  {
		  System.out.println(res%10);
	  }
	   
		
		//end
	}
	
}
