C语言 问题：Arpa’s hard exam and Mehrdad’s naive cheat

Arpa’s hard exam and Mehrdad’s naive cheat

There exists an island called Arpa’s land, some beautiful girls live there, as ugly ones do.

Mehrdad wants to become minister of Arpa’s land. Arpa has prepared an exam. Exam has only one question, given n, print the last digit of 1378n.

Mehrdad has become quite confused and wants you to help him. Please help, although it's a naive cheat.

Input

The single line of input contains one integer n (0  ≤  n  ≤  109).

Output

Print single integer — the last digit of 1378n.

Examples

Input

1

Output

8

Input

2

Output

4

#include <stdio.h>
#include <stdlib.h>
#include <math.h>       //8 4 2 6   8
#include <string.h>    //这道题的关键是8的n次方的尾数是规律变化的
int main()
{
    int n;
    scanf("%d", &n);
    if(n == 0)  printf("1\n");//此处有特殊情况仍需注意，当n为0时，结果为1
    else
    {
        n %= 4;
        switch(n)
        {
            case 0: printf("6\n");break;
            case 1: printf("8\n");break;
            case 2: printf("4\n");break;
            case 3: printf("2\n");break;
        }
    }
    return 0;
}

 

Note

In the first example, last digit of 13781 = 1378 is 8.

In the second example, last digit of 13782 = 1378·1378 = 1898884 is 4.