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

public class R
{  
    public static void main(String args[])
    {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt(); List<Integer> l1 = new ArrayList<Integer>(); HashSet<Integer> h = new HashSet<Integer>();
        l1.add(0);
        boolean flag = true; int i = 1, temp = 0;
        while(flag) {
            temp = (int) Math.pow(8,i) % 10;
            //System.out.println(temp);
            if(h.contains(temp)) {
                //System.out.println("break "+temp);
                break;
            }
            i++;
            l1.add(temp);
            h.add(temp);
        }
        //System.out.println(l1);
        System.out.println( l1.get( (n%l1.size()) ) );
    }
}