| 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 can 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.
Sample Input
Input
2
Output
25
Sample Output
Hint
Source
输出5的n次方的后两位，n>=2，所以嘛，只可能是25
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
__int64 n;
while(cin>>n)
cout<<25<<endl;
return 0;
}