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·10^18) — the power in which you need to raise number 5.


-----Output-----

Output the last two digits of 5^{n} without spaces between them.


-----Examples-----
Input
2

Output
25

Difficulty: EASY

Solutions:
n = int(input())
if n >= 2:
	print('25')
if n == 1:
	print('05')
if n == 0:
	print('01')


n = int(input())
print(25)


def solve(test):
	print(25)
t = 1
for _ in range(t):
	solve(_ + 1)


__author__ = 'panag'
print(25)


a = int(input())
if a > 1:
	print(25)
if a == 1:
	print(5)
if a == 0:
	print(1)


t = int(input())
print(25)


user = int(input())
print('25')


n = input('')
print(25)


x = int(input())
print(25)


from math import *
from copy import *
from string import *
from random import *
from sys import stdin
from sys import maxsize
from operator import *
from itertools import *
from collections import Counter
import math

def bin1(l, r, k, t, b, val, ans):
	if l > r:
		return ans
	else:
		mid = (l + r) // 2
		v = k ** mid
		if v == val:
			return v
		elif v > val:
			ans = mid
			return bin1(mid + 1, r, k, t, b, val, ans)
		else:
			return bin1(l, mid - 1, k, t, b, val, ans)

def bin2(l, r, k, t, b, val, ans):
	if l > r:
		return ans
	else:
		mid = (l + r) // 2
		v = t * k ** mid + b * mid
		if v == val:
			return v
		elif v > val:
			ans = mid
			return bin2(l, mid - 1, k, t, b, val, ans)
		else:
			return bin2(mid + 1, r, k, t, b, val, ans)

def SieveOfEratosthenes(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	l = []
	for i in range(2, n + 1):
		if prime[i]:
			l.append(i)
	return l

def bin(l, r, ll, val):
	if l > r:
		return -1
	else:
		mid = (l + r) // 2
		if val >= ll[mid][0] and val <= ll[mid][1]:
			return mid
		elif val < ll[mid][0]:
			return bin(l, mid - 1, ll, val)
		else:
			return bin(mid + 1, r, ll, val)

def deci(n):
	s = ''
	while n != 0:
		if n % 2 == 0:
			n = n // 2
			s = '0' + s
		else:
			n = n // 2
			s = '1' + s
	return s

def diff(s1, s2):
	if len(s1) < len(s2):
		v = len(s1)
		while v != len(s2):
			s1 = '0' + s1
			v = v + 1
	else:
		v = len(s2)
		while v != len(s1):
			s2 = '0' + s2
			v = v + 1
	c = 0
	for i in range(len(s1)):
		if s1[i:i + 1] != s2[i:i + 1]:
			c = c + 1
	return c
from sys import stdin, stdout

def fac(a, b):
	v = a
	while a != b:
		v *= a - 1
		a = a - 1
	return v

def bino(l, r, n):
	if l > r:
		return -1
	else:
		mid = (l + r) // 2
		val1 = math.log(n / mid + 1, 2)
		val2 = int(val1)
		if val1 == val2:
			return val1
		elif val1 < 1.0:
			return bino(l, mid - 1, n)
		else:
			return bino(mid + 1, r, n)

def binary(l, r, ll, val, ans):
	if l > r:
		return ans
	else:
		mid = (l + r) // 2
		if ll[mid] == val:
			return ll[mid]
		elif ll[mid] < val:
			ans = ll[mid]
			return binary(mid + 1, r, ll, val, ans)
		else:
			return binary(l, mid - 1, ll, val, ans)

def check(n):
	v = 1
	while n != 0:
		if n % 10 == 0 or n % 10 == 1:
			n = n // 10
		else:
			v = 0
			break
	return v

def stairs(n, m, val, c, l):
	if val > n:
		return 100000
	elif val == n:
		if l[val] != -1:
			return l[val]
		elif c % m == 0:
			l[val] = c
			return l[val]
		else:
			l[val] = 100000
			return l[val]
	else:
		l[val] = min(stairs(n, m, val + 1, c + 1, l), stairs(n, m, val + 2, c + 1, l))
		return l[val]
n = int(input())
print(25)


n = int(input())
if n == 1:
	print(5)
else:
	print(25)


print(25)


import math, fractions
n = int(input())
print(25)


import time
n = int(input())
start = time.time()
print(25)
finish = time.time()


k = input()
print('25')


import sys
input = sys.stdin.readline

def ceil(x):
	if x != int(x):
		x = int(x) + 1
	return x

def factorial(x, m):
	val = 1
	while x > 0:
		val = val * x % m
		x -= 1
	return val

def fact(x):
	val = 1
	while x > 0:
		val *= x
		x -= 1
	return val

def swaparr(arr, a, b):
	temp = arr[a]
	arr[a] = arr[b]
	arr[b] = temp

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)

def nCr(n, k):
	if k > n:
		return 0
	if k > n - k:
		k = n - k
	res = 1
	for i in range(k):
		res = res * (n - i)
		res = res / (i + 1)
	return int(res)

def upper_bound(a, x, lo=0, hi=None):
	if hi == None:
		hi = len(a)
	while lo < hi:
		mid = (lo + hi) // 2
		if a[mid] < x:
			lo = mid + 1
		else:
			hi = mid
	return lo

def primefs(n):
	primes = {}
	while n % 2 == 0 and n > 0:
		primes[2] = primes.get(2, 0) + 1
		n = n // 2
	for i in range(3, int(n ** 0.5) + 2, 2):
		while n % i == 0 and n > 0:
			primes[i] = primes.get(i, 0) + 1
			n = n // i
	if n > 2:
		primes[n] = primes.get(n, 0) + 1
	return primes

def power(x, y, p):
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def swap(a, b):
	temp = a
	a = b
	b = temp
	return (a, b)

def find(x, link):
	p = x
	while p != link[p]:
		p = link[p]
	while x != p:
		nex = link[x]
		link[x] = p
		x = nex
	return p

def union(x, y, link, size):
	x = find(x, link)
	y = find(y, link)
	if size[x] < size[y]:
		(x, y) = swap(x, y)
	if x != y:
		size[x] += size[y]
		link[y] = x

def sieve(n):
	prime = [True for i in range(n + 1)]
	(prime[0], prime[1]) = (False, False)
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	return prime
MAXN = int(100000.0 + 5)

def spf_sieve():
	spf[1] = 1
	for i in range(2, MAXN):
		spf[i] = i
	for i in range(4, MAXN, 2):
		spf[i] = 2
	for i in range(3, ceil(MAXN ** 0.5), 2):
		if spf[i] == i:
			for j in range(i * i, MAXN, i):
				if spf[j] == j:
					spf[j] = i
spf = [0 for i in range(MAXN)]

def factoriazation(x):
	res = []
	for i in range(2, int(x ** 0.5) + 1):
		while x % i == 0:
			res.append(i)
			x //= i
	if x != 1:
		res.append(x)
	return res

def int_array():
	return list(map(int, input().strip().split()))

def float_array():
	return list(map(float, input().strip().split()))

def str_array():
	return input().strip().split()
MOD = int(1000000000.0) + 7
CMOD = 998244353
INF = float('inf')
NINF = -float('inf')
from itertools import permutations
import math
from bisect import bisect_left

def solve():
	print(25)
for _ in range(1):
	solve()


n = int(input())
print(pow(5, n, 100))


import sys
n = int(sys.stdin.readline())
print(25)


def t25():
	n = int(input())
	if n < 2 or n > 2 * 10 ** 18:
		return
	print(25)
t25()


from math import gcd

def solve():
	n = int(input())
	print(25)
solve()


x = int(input())
if x == 1:
	print('5')
else:
	print('25')


n = int(input())
x = 65
y = 56
i = 80
f = 9
d = 0
t = 78
print(25)


def main(n):
	return 25
n = int(input())
ans = main(n)
print(ans)


import math
from fractions import Fraction as frac
MOD = 1000000000.0 + 7

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)

def lcm(a, b):
	return a * b // gcd(a, b)

def solve(case_no):
	print(25)
t = 1
for i in range(1, t + 1):
	solve(i)


input('25')


pow = int(input())
if pow == 0:
	print('01')
elif pow < 2:
	print('05')
else:
	print('25')


import sys, math
print(pow(5, int(input()), 100))


b = int(input())
resultado2 = pow(5, b, 100)
print(resultado2)


import re, sys, string, operator, functools, fractions, collections
sys.setrecursionlimit(10 ** 7)
dX = [-1, 1, 0, 0, -1, 1, -1, 1]
dY = [0, 0, -1, 1, 1, -1, -1, 1]
RI = lambda x=' ': list(map(int, input().split(x)))
RS = lambda x=' ': input().rstrip().split(x)
mod = int(1000000000.0 + 7)
eps = 1e-06
print(25)


import sys
input = sys.stdin.readline
n = input()
print('25')


import math
int(input())
print(25)


x = input()
print('25')


number = int(input())
print(25)


def run():
	num = eval(input())
	print('25')
run()


def main():
	input()
	print(25)
main()


n = int(input())
if n == 1:
	print('5')
if n >= 2:
	print('25')


_ = int(input())
print(25)


from __future__ import division, print_function
import os, sys
from io import BytesIO, IOBase
import math
if sys.version_info[0] < 3:
	from __builtin__ import xrange as range
	from future_builtins import ascii, filter, hex, map, oct, zip

def ii():
	return int(input())

def si():
	return input()

def mi():
	return map(int, input().strip().split(' '))

def msi():
	return map(str, input().strip().split(' '))

def li():
	return list(mi())

def dmain():
	sys.setrecursionlimit(1000000)
	threading.stack_size(1024000)
	thread = threading.Thread(target=main)
	thread.start()
abc = 'abcdefghijklmnopqrstuvwxyz'
abd = {'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod = 1000000007
inf = float('inf')
vow = ['a', 'e', 'i', 'o', 'u']
(dx, dy) = ([-1, 1, 0, 0], [0, 0, 1, -1])

def getKey(item):
	return item[1]

def sort2(l):
	return sorted(l, key=getKey, reverse=True)

def d2(n, m, num):
	return [[num for x in range(m)] for y in range(n)]

def isPowerOfTwo(x):
	return x and (not x & x - 1)

def decimalToBinary(n):
	return bin(n).replace('0b', '')

def ntl(n):
	return [int(i) for i in str(n)]

def ncr(n, r):
	return factorial(n) // (factorial(r) * factorial(max(n - r, 1)))

def ceil(x, y):
	if x % y == 0:
		return x // y
	else:
		return x // y + 1

def powerMod(x, y, p):
	res = 1
	x %= p
	while y > 0:
		if y & 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def gcd(x, y):
	while y:
		(x, y) = (y, x % y)
	return x

def isPrime(n):
	if n <= 1:
		return False
	if n <= 3:
		return True
	if n % 2 == 0 or n % 3 == 0:
		return False
	i = 5
	while i * i <= n:
		if n % i == 0 or n % (i + 2) == 0:
			return False
		i = i + 6
	return True

def read():
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')

def main():
	print('25')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


3
n = int(input())
print('25')


def again_twenty():
	a = int(input())
	print(25)
again_twenty()


w = int(input())
print(25)


import math
input()
print(25)


n = int(input())
print(2 if n == 1 else 25)


number = input()
print('25')


def pow(base, power, mod):
	if power == 1:
		return base % mod
	if power == 0:
		return 1
	x = pow(base, power // 2, mod) % mod
	if power % 2 == 0:
		return x * x % mod
	else:
		return x * x * (base % mod) % mod
n = int(input())
if n < 2:
	print('WRONG INPUT!')
elif n > 2000000000000000000:
	print('WRONG INPUT!')
elif n < 10000000:
	print(5 ** n % 100)
else:
	print(pow(5, n, 100) % 100)


z = input()
print(25)


X = int(input())
print(25)


import sys
import math
import bisect

def main():
	n = int(input())
	if n == 1:
		print(5)
	else:
		print(25)
main()


n = int(input())
b = 5
res = 1
pow = n
while pow > 1:
	if pow % 2 != 0:
		pow = pow - 1
		res = res * b
	else:
		pow = pow // 2
		res = res * b * b
print(res % 100)


import sys
from math import sqrt, floor
inp = sys.stdin.readline
read = lambda : list(map(int, inp().split()))

def solve():
	i = inp()
	print('25')
solve()


def sol(n):
	return 25
n = int(input())
print(sol(n))


input()
print(25)


n = float(input(''))
print(25)


q = input()
print(25)


n = input('25')


from timeit import timeit
n = int(input())
print('25')


x = eval(input())
if x == 1:
	print(5)
else:
	print(25)


import math

def s():
	n = int(input())
	return 25
ans = s()
print(ans)


y = int(input())

def square(x):
	return x * x

def binary_exp(x, y):
	if y == 0:
		return 1
	elif y % 2 == 0:
		return square(binary_exp(x, y // 2)) % 100
	else:
		return square(binary_exp(x, y // 2)) * x % 100
print(binary_exp(5, y))


def solve(n):
	if n == 0:
		return 1
	ans = solve(n // 2)
	ans = ans * ans
	if n % 2 == 1:
		ans = ans * 5
	ans = ans % 100
	return ans
n = int(input())
print(solve(n))


c = int(input())
print(25)


while True:
	try:
		s = input()
		print(25)
	except:
		break


def main():
	print(solver())

def solver():
	return 25
main()


a = map(int, input().split())
if a == 0:
	print(1)
else:
	print(25)


n = int(input())
a = 5 ** (n - (n - 2))
a = str(a)
print(a[-2:])


n = int(input())
if n != 1:
	print('25')
else:
	print('05')


s = int(input())
print('25')


a = input()
print('25')


def max1(a):
	p = a[0]
	for x in a:
		if x > p:
			p = x
	return p

def preobr(x):
	if x % 2 == 1:
		return x + 1
	else:
		return x - 1

def prlist(a):
	for x in a:
		print(x, end=' ')

def dlin(n):
	k = 0
	while n > 0:
		n -= k
		k += 1
	return k - 1

def foundm(x, a):
	for i in range(len(a)):
		if x == a[i]:
			return i
	return -1

def max1m(a):
	k = max(a)
	for i in range(len(a)):
		if a[i] == k:
			return i

def min1m(a):
	k = min(a)
	for i in range(len(a)):
		if a[i] == k:
			return i
n = int(input())
print(25)


print(pow(5, 2))


a = input()
a = int(a)
print(25)


x = int(input())
print(pow(5, x, pow(10, 2)) if x > 1 else 5)


def func(n):
	print(25)
n = int(input())
func(n)


num = input()
print(25)


x = input()
print(pow(5, int(x), 100))


def main():
	n = int(input())
	print(25)
main()


print(''.join([str(int(i) ** 2) for i in list(str(5))]))


int(input())
print(25)


def solve(n):
	calc = 5
	print('25')
user = int(input())
solve(user)


n = int(input())
print(5 ** n if n < 2 else 25)


from sys import stdin, stdout
from gc import disable

def main() -> int:
	disable()
	stdout.write('25')
	return 0
main()


n = int(input())
x = 25
print(x)


a = int(input())
res = 1
b = 5
res = 5
if a > 1:
	res = res * 5
print(res)


x = input('25')


def solve():
	n = int(input())
	print('25')
solve()


s = input()
print(25)


p = int(input())
print('25')


def LastTwoDigits(n):
	if n == 1:
		return 5
	else:
		return 25
print(LastTwoDigits(int(input())))


_ = input()
print(25)


num = int(input())
if num >= 2:
	print('25')
elif num == 1:
	print('5')
else:
	print('1')


number = int(input())
if number == 0:
	print(1)
elif number == 1:
	print(5)
else:
	print(25)


n = int(input())
if n >= 2:
	print(25)


i = int(input(''))
if i == 1:
	print('05')
else:
	print('25')


def pw(a, b):
	ans = 1
	while b > 0:
		if b % 2 == 1:
			ans = ans * a % 100
		a = a * a % 100
		b >>= 1
	return ans
n = int(input())
print(pw(5, n))


n = 5
x = int(input())
r = pow(n, x - 1, 100) * n % 100
print(r)


i = 0
for j in range(25):
	i += 1
print(i)


import math
import collections
import bisect
import heapq
import time
import random
import itertools
import sys
N = int(input())
print(25)


m = input()
print('25')


n = int(input())
if n >= 2 and n <= 2 * 10 ** 18:
	print(25 * 1)


a = input()
a = int(a)
k = 25
print(k)


power = int(input())

def check(power):
	return 25
print(check(power))


def five(n):
	return 25
print(five(int(input())))


n = 25
print(n)


def binP(x, p):
	if p == 0:
		return 1
	temp = binP(x, p // 2)
	temp = temp % 100
	if p & 1 == 1:
		return temp * temp * x
	return temp * temp
n = int(input())
print(binP(5, n) % 100)


n = int(input())
if n >= 2:
	print('25')
else:
	print('wrong entry')


is_debug = False
n = int(input())
if n == 0:
	print('1')
elif n == 1:
	print('5')
else:
	print('25')


n = int(input())
out = 25
if n == 1:
	out = 5
print(out)


def lastTwo(n):
	if n == 0:
		return 1
	if n == 1:
		return 5
	return 25
n = str(input())
print(lastTwo(n))


a = int(input())
if a == 1:
	print(5)
else:
	print(25)


const = 5
n = int(input())
power = const ** 2
to = str(power)
if len(to) > 4:
	print('25')
else:
	print(to[len(to) - 2] + to[len(to) - 1])


n = int(input())
a = n ^ 25
b = a - 25
print(a - b)


n = input
print(5 ** 2)


N = int(input())
print('25')


import sys

def main():
	x = int(sys.stdin.readline())
	print(25)
main()


n = int(input())
if len(str(n)) > 2:
	n = 10
print(str(int(5) ** n)[-2:])


print(str(pow(5, int(input()), 100))[-2:])


import math
import sys
import re
n = int(input())
print(25)


while True:
	try:
		x = int(input())
		if x == 1:
			print(5)
		else:
			print(25)
	except:
		break


n = int(input())
if n == 1:
	print(5)
elif n == 0:
	print(1)
else:
	print(25)


if int(input()) == 1:
	print(1)
else:
	print(25)


n = int(input())
if n == 0:
	print('1')
else:
	print('25')


print(5 ** 2)


if int(input()):
	print(25)


try:
	n = int(input())
	print(25)
except:
	pass


n = int(input())
if n == 0:
	print(1)
if n == 1:
	print(5)
print(25)


n = int(input())
if n > 1:
	print(25)


def fact(a, n, m):
	if n == 0:
		return 1
	elif n % 2 == 0:
		return fact(a * a % m, n / 2, m)
	elif n % 2 != 0:
		return a * fact(a * a % m, (n - 1) / 2, m) % m
n = int(input())
z = fact(5, n, 1000)
k = str(z)
h = len(k)
print(k[h - 2:h])


def pow(n):
	if n == 1:
		return 5 % 100
	if n == 0:
		return 1
	x = pow(n // 2) % 100
	if n % 2 == 0:
		return x * x % 100
	else:
		return x * x * (5 % 100) % 100
n = int(input())
print(pow(n) % 100)


from sys import stdin
num = int(stdin.readline())
print(25)


n = int(input())
if n < 3:
	print(5 ** n)
else:
	print(25)


i = int(input())
print(25)


t = input()
print(25)


def getint():
	return map(int, stdin.readline().strip().split())
from string import *
from math import *
from fractions import *
from decimal import *
from sys import *
from collections import *
from array import *
import os
import shutil
import heapq
a = int(input())
if a == 0:
	print('1')
elif a == 1:
	print('5')
else:
	print(25)


n = int(input())
li = [6, 8, 4, 2]
print(25)


import webbrowser
if True == False:
	url = input()
	while True:
		webbrowser.open(url)
else:
	n = input()
	print(25)


import sys
n = int(input())
print(25)
sys.exit(0)
if n < 100:
	print(str(5 ** n)[-2:])
	sys.exit(0)
check = []
i = 0
while 5 ** i % 100 not in check:
	check.append(5 ** i % 100)
	i += 1
print(check)
print(5 ** i % 100)
r = n % 3
print('r =', r)
print(str(5 ** r), 5 ** n)


from sys import stdin
t = int(stdin.readline())
print('25')


exec('input(); print(25)')


import sys
input = sys.stdin.readline
n = int(input())

def powf(n):
	if n <= 1:
		return 5 ** n
	elif n % 2:
		return 5 * powf(n - 1) % 100
	else:
		return powf(n // 2) ** 2 % 100
print(powf(n))


n = int(input())
print('{}'.format(25))


n = input()
try:
	n = int(n)
	print(25)
except:
	print('INVALID INPUT')


print(25)
pass
pass
pass
pass
pass
pass
pass
pass
pass
pass
pass
pass
pass
pass
pass
pass


n = int(input())
import math
x = math.pow(5, 2)
x = str(int(x))
print(x[-2:])


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
eps = 1.0 / 10 ** 10
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return [int(x) for x in sys.stdin.readline().split()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def LF():
	return [float(x) for x in sys.stdin.readline().split()]

def LS():
	return sys.stdin.readline().split()

def I():
	return int(sys.stdin.readline())

def F():
	return float(sys.stdin.readline())

def S():
	return input()

def pf(s):
	return print(s, flush=True)

def main():
	n = I()
	return 25
print(main())


inp = int(input())
print(25)


from sys import stdin, stdout
from collections import Counter
from math import ceil
from bisect import bisect_left
from bisect import bisect_right
import math
ai = lambda : list(map(int, stdin.readline().split()))
ei = lambda : map(int, stdin.readline().split())
ip = lambda : int(stdin.readline().strip())
M = 100

def modularExponentiation(x, n, M):
	if n == 0:
		return 1
	elif n % 2 == 0:
		return modularExponentiation(x * x % M, n // 2, M)
	else:
		return x * modularExponentiation(x * x % M, (n - 1) // 2, M) % M
n = ip()
x = str(int(modularExponentiation(5, n, M)))
print(x[-2:])


a = int(input())
if a == 0:
	print(1)
elif a == 1:
	print(5)
else:
	print(25)


m = int(input())
print('25')


print(20 * (int(input()) > 1) + 5)


a = int(input(''))
b = 1
c = 1
d = 1
e = 1
print(25)


result = 1
x = 5
n = int(input())
while n > 0:
	if n % 2 != 0:
		result = result * x % 100
	x = x * x % 100
	n = n // 2
print(result)


import sys
n = int(input())
print(25)


n = eval(input())
if n == 0:
	print('01')
elif n == 1:
	print('05')
else:
	print('25')


t = int(input())
print(pow(5, t, 100))


print(0 * int(input()) + 25)


import math

def main():
	n = int(input())
	print(25)
main()


def twenty_five():
	print('25')
twenty_five()


x = eval(input())
print(25)


def main():
	power = int(input())
	print(stepen(power))

def stepen(power):
	return 25
main()


def app():
	integer = int(input())
	print(25)
app()


def main():
	print(pow(5, int(input()), 100))
main()


ass = input()
print(25)


n = int(input())
if n % 2 == 0:
	print(25)
else:
	print(25)


a = 25
print(a)


num = input()
if num == '0':
	print(str(1))
elif num == '1':
	print(str(5))
else:
	print(str(25))


T = int(input())
print(25)


n = int(input())
if n < 2:
	s = 5 ** n
	print(s % 100)
else:
	print(25)


print('25'[int(input()) < 2:])


n = int(input())
if n == 0:
	print('01')
elif n == 1:
	print('05')
else:
	print('25')


n = int(input())
while n >= 2:
	print(25)
	break


n = int()
print(25)


import math
num = int(input())
n = 5
print(25)


nb = int(input())
print(5 ** nb if nb <= 1 else 25)


inValue = int(input().strip())
print(pow(5, inValue, 100))


__author__ = 'Md. Imrul Hasan @UAP-CSE'
n = int(input())
print('25')


t = int(input())
if t == 1:
	print(5)
else:
	print(25)


x = int(input())
if x > 1:
	print(25)
elif x == 0:
	print(1)
else:
	print(5)


def pow(base, power, mod):
	if power == 1:
		return base % mod
	if power == 0:
		return 1
	x = pow(base, power // 2, mod) % mod
	if power % 2 == 0:
		return x * x % mod
	else:
		return x * x * (base % mod) % mod
n = int(input())
print(pow(5, n, 100) % 100)


def calc(n):
	if n <= 2:
		return 5 ** n % 100
	m = calc(n // 2)
	if n % 2 == 1:
		return m * m * 5 % 100
	else:
		return m * m % 100
print(calc(int(input())))


import math
n = int(input())
if n == 1:
	print(5)
elif n == 0:
	print(1)
else:
	print(25)


def main():
	print(25)
main()


from math import ceil, log, floor, sqrt
import math
k = 1

def mod_expo(n, p, m):
	result = 1
	while p != 0:
		if p % 2 == 1:
			result = result * n % m
		p //= 2
		n = n * n % m
	return result

def is_prime(n):
	m = 2
	while m * m <= n:
		if n % m == 0:
			return False
		m += 1
	return True

def find_sum(n, a):
	a.insert(0, 0)
	for i in range(1, n + 1):
		prev = a[i] & a[i - 1]
		cur = a[i] | a[i - 1]
		a[i - 1] = prev
		a[i] = cur
	return sum((m * m for m in a))

def prin_abc(x, y, z):
	l = [x, y, z]
	l.sort()
	if l[1] < l[2]:
		print('NO')
		return
	a = b = l[0]
	c = l[2]
	print('YES')
	print(a, b, c)

def get_rank(n, stones):
	x = 0
	turn = 0
	winner = False
	for i in range(n - 2, -1, -1):
		if winner:
			winner = not winner
		elif stones[i] == 1 and (not winner):
			winner = True
	if not winner or stones[0] > 1:
		print('First')
	else:
		print('Second')

def count_lamps(n, m):
	return (n * m + 1) // 2
t = 1
while t:
	t = t - 1
	points = []
	n = int(input())
	print(mod_expo(5, n, 100))


def last(n):
	n = int(n)
	yield (n - int(n / 10) * 10)
	n = int(n / 10)
	yield (n - int(n / 10) * 10)
n = int(input())
print(25)


def f(n):
	(x, y) = (1, 5)
	while n > 0:
		if n % 2 == 1:
			x = x * y % 100
		y = y * y % 100
		n = n // 2
	return x
print(f(int(input())))


value = int(input().strip())
if value == 0:
	print(1)
elif value == 1:
	print(5)
else:
	print(25)


n = eval(input())
print(25)


a = int(input())
print(5 ** 2)


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return [int(x) for x in sys.stdin.readline().split()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def I():
	return int(sys.stdin.readline())

def LS():
	return sys.stdin.readline().split()

def S():
	return input()

def main():
	I()
	return 25
print(main())


def main():
	d = input()
	print(25)
main()


import sys
import datetime

def main():
	print(25)
main()


m = int(input())
print(5) if m == 1 else print(25)


import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush, nlargest, nsmallest, _heapify_max, _heapreplace_max
from math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf, log
from collections import defaultdict as dd, deque, Counter as c
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from fractions import Fraction
mod = pow(10, 9) + 7
mod2 = 998244353

def data():
	return sys.stdin.readline().strip()

def out(*var, end='\n'):
	sys.stdout.write(' '.join(map(str, var)) + end)

def l():
	return list(sp())

def sl():
	return list(ssp())

def sp():
	return map(int, data().split())

def ssp():
	return map(str, data().split())

def l1d(n, val=0):
	return [val for i in range(n)]

def l2d(n, m, val=0):
	return [l1d(n, val) for j in range(m)]
n = data()
out(25)


t = int(input())
if t == 0:
	print('01')
elif t == 1:
	print('25')
else:
	print('25')


n = int(input())
print(pow(5, n, 10 ** 9) % 100)


def read_number_line():
	return [int(i) for i in input().split()]
print(25)


i = input()
print('25')


import sys
import math
num = int(sys.stdin.readline())
print(25)


_ = map(int, input())
print(25)


num = int(input())
print(25)


e = int(input())
print('25')


def read_input(filename: str=None) -> None:
	from sys import stdin
	stdin = open(filename) if filename else stdin
	_ = int(stdin.readline())
	print(25)

def main():
	read_input()
main()


from math import pow
n = int(input())
print(25)


import math
t = 1
while t > 0:
	t -= 1
	n = int(input())
	print(25)


def ans(a):
	return 25
n = int(input(''))
print(ans(n))


n = int(input())
if n == 0:
	print('00')
elif n == 1:
	print('05')
else:
	print('25')


number = str(input())
print('25')


n = int(input())
print(5 ** 2)


power = int(input())
print('25')


n = int(input())
result = 5 ** 2
print(str(result))


power = int(input())
if power > 1:
	print('25')
else:
	print(5 ** power)


def solve(n):
	return 25

def main():
	n = int(input())
	print(solve(n))
main()


import collections
import math
n = input()
print(25)


def againTwentyFive():
	n = int(input())
	if n <= 1:
		print('0' + str(pow(5, n)))
	else:
		print('25')
againTwentyFive()


k = int(input())
if k == 1:
	print('05')
else:
	print('25')


z = int(input())
print(25)


n = int(input())
d = list(str(n))
print(25)


import math
from operator import itemgetter

def get_primes(prime_supr):
	is_prime = [0] * 2 + [1] * prime_supr
	for i in range(2, int(math.sqrt(prime_supr)) + 1):
		if is_prime[i]:
			for j in range(i * i, prime_supr + 1, i):
				is_prime[j] = 0
	return is_prime
get_int = lambda : map(int, input().split())
n = int(input())
print(25)


import sys
import os
a = int(input())
if a == 0:
	print(1)
elif a == 1:
	print(5)
else:
	print(25)


a = int(input())
b = 'fuck off'
c = b[-1]
d = b[-2]
print(25)


k = 5
n = int(input())
print(25)


t = int(input())
p = 25
print(p % 100)


from sys import stdin, stdout
from gc import disable

def power(a: int, n: int, m: int) -> int:
	if n == 0:
		return 1 % m
	if n & 1:
		return power(a, n - 1, m) * a % m
	else:
		x = power(a, n // 2, m)
		return x * x % m

def main() -> int:
	disable()
	a = 5
	n = int(stdin.readline())
	m = 100
	ans = power(a, n, m)
	stdout.write('%i' % ans)
	return 0
main()


a = int(input())
print(pow(5, a, 100))


import sys
import math

def main():
	n = int(sys.stdin.readline().strip())
	print(25)
main()


print(25, end='')


from __future__ import division, print_function
from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase
from itertools import *
import bisect
from heapq import *
from math import *
from copy import *
from collections import deque
from collections import Counter as counter
from itertools import combinations as comb
from itertools import permutations as permutate
from bisect import bisect_left as bl
from bisect import bisect_right as br
from bisect import bisect
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
mod = 1000000007

def inp():
	return sys.stdin.readline().rstrip('\r\n')

def out(var):
	sys.stdout.write(str(var))

def lis():
	return list(map(int, inp().split()))

def stringlis():
	return list(map(str, inp().split()))

def sep():
	return map(int, inp().split())

def strsep():
	return map(str, inp().split())

def zerolist(n):
	return [0] * n

def nextline():
	out('\n')

def testcase(t):
	for p in range(t):
		solve()

def printlist(a):
	for p in range(0, len(a)):
		out(str(a[p]) + ' ')

def lcm(a, b):
	return a * b // gcd(a, b)

def power(a, b):
	ans = 1
	while b > 0:
		if b % 2 == 1:
			ans *= a
		a *= a
		b //= 2
	return ans

def ncr(n, r):
	return factorial(n) // (factorial(r) * factorial(max(n - r, 1)))

def isPrime(n):
	if n <= 1:
		return False
	if n <= 3:
		return True
	if n % 2 == 0 or n % 3 == 0:
		return False
	i = 5
	while i * i <= n:
		if n % i == 0 or n % (i + 2) == 0:
			return False
		i = i + 6
	return True

def solve():
	n = int(inp())
	print(25)
testcase(1)


import os, sys, pdb
n = list(map(int, input().split()))
print(25)


import os
import sys
from io import BytesIO, IOBase

def main():
	n = int(input())
	print(25)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


import sys
input()
print(25)


from sys import stdin
num1 = stdin.readline().strip()
print(25)


n = [int(x) for x in input().split()]
if n == 0:
	print(1)
elif n == 1:
	print(5)
else:
	print(25)


def answer():
	return 25
print(answer())


def powered(n):
	print(25)
n = int(input())
powered(n)