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;

public class Codeforces {
    public static void main(String[] args) {
        long mainValue = 1378;
        long plurar =0;
        long score =0;
        Scanner sc = new Scanner(System.in);
        plurar = sc.nextInt();
        score = (long) Math.pow(mainValue, plurar);
        System.out.println(score);
        String lastDigit = Long.toString(score);
        System.out.println(lastDigit.charAt(lastDigit.length()-1));
    }
}






