Time Limit: 500MS | | Memory Limit: 65536KB | | 64bit IO Format: %I64d & %I64u |
Description
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, n
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
Sample Input
Input
2
Output
25
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#define INF 0x3f3f3f3f
#define ll long long
#define N 10010
#define M 1000000007
using namespace std;
int main()
{
ll n;
while(scanf("%lld",&n)!=EOF)
{
printf("25\n");
}
return 0;
}
