跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1361. Again Twenty Five!

    ID: 1367 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 1 上传者: 标签>数论数学入门难度共享题库Codeforces英文题面题目来源题面语言

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, 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
2
Output
25

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 860 题。保留原作者与原赛事署名。