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

// @author Alhussain Aly
import java.util.*;
import java.math.*;
public class R383_2_A {
  public static void main(String[] args) {
    Scanner in=new Scanner(System.in);
    BigInteger n = in.nextBigInteger();
    BigInteger a = new BigInteger("1378");
    System.out.println(a.modPow(n, BigInteger.TEN));    
  }
}
