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?
The only line of the input contains a single integer *n* (2 ≤ *n* ≤ 2·10<sup class="upper-index">18</sup>) — the power in which you need to raise number 5.
none
2
25
7
25
1000000000000000000
25
2000000000000000000
25
987654321012345678
25
# Problem:
# Answer:

# **********************

# I think the answer to this problem is that 5 to any power other than 1 will end with the digits 25. 

# When you multiply 5*5, the answer is 25.
# 5*5*5 = 25 * 5 = 125.
# 5*5*5*5 = 125 * 5 = 625.

# In school you do manual multiplication by moving from the top-right to the top left of the first number. So 25*5 evaluates as 5*5 = 25. 2 get carried over to the 2 in 25. 2*5 = 10, then add the 2 carried over to get 12. So the final answer is 125. Once you get 25 at the end of a number, the pattern repeats for any number, no matter how large it is.

# **********************

number = int(input())

if number == 1:
    print(5)
else:
    print(25)