Algorithm

A. Again Twenty Five!
time limit per test
0.5 seconds
memory limit per test
64 megabytes
problem link- https://codeforces.com/problemset/problem/630/A
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, 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.

Examples
input
Copy
2
output
Copy
25



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include<bits/stdc++.h>
using namespace std;


#define ll long long
#define endl '\n'
#define debug(n) cout<<(n)<<endl;
const ll INF = 2e18 + 99;

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int n;
  cin>>n;
  cout<<25;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
2

Output

x
–
+
cmd
25
Advertisements

Demonstration

Codeforcess Solution 630-A A. Again Twenty Five! ,C++, Java, Js and Python ,630-A,Codeforcess Solution

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+