CodeForces-630A. Again Twenty Five!【找规律】-蒲公英云

CodeForces-630A. Again Twenty Five!【找规律】

A. Again Twenty Five!

time limit per test

0.5 seconds

memory limit per test

64 megabytes

input

standard input

output

standard output

The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. “Do I give such a hard task?” — the HR manager thought. “Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, ncan be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions.”

Could you pass the interview in the machine vision company in IT City?

Input

The only line of the input contains a single integer n (2 ≤ n ≤ 2·1018) — the power in which you need to raise number 5.

Output

Output the last two digits of 5n without spaces between them.

Examples

input

output

25
解题思路：
就是求5^n的最后两位，一看就知道是25.
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char map[50];
int main()
{
    while(scanf("%s",map)!=EOF)
    {
        if(strcmp(map,"1")==0)
        {
            printf("5\n");
        }
        else
        {
            printf("25\n");
        }
    }
    return 0;
}