​​点击打开链接​​

A. Again Twenty Five!

time limit per test

memory limit per test

input

output

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

n (2 ≤ n ≤ 2·1018) — the power in which you need to raise number 5.

Output

5n

Examples

input

2

output

25

这个题千万别一直一直*5，这样会超时，n从2开始取，就是25，然后发现25*5末两位还是25，所以结果直接输出25。 

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
typedef long long ll;
using namespace std;
const ll mod=100000000;
int main()
{
    ll n;
    cin>>n;
    cout<<25<<endl;
    return 0;
}