This year, as in previous years, MemSQL is inviting the top 25 competitors from the Start[c]up qualification round to compete onsite for the final round. Not everyone who is eligible to compete onsite can afford to travel to the office, though. Initially the top 25 contestants are invited to come onsite. Each eligible contestant must either accept or decline the invitation. Whenever a contestant declines, the highest ranked contestant not yet invited is invited to take the place of the one that declined. This continues until 25 contestants have accepted invitations.

After the qualifying round completes, you know K of the onsite finalists, as well as their qualifying ranks (which start at 1, there are no ties). Determine the minimum possible number of contestants that declined the invitation to compete onsite in the final round.


-----Input-----

The first line of input contains K (1 ≤ K ≤ 25), the number of onsite finalists you know. The second line of input contains r_1, r_2, ..., r_{K} (1 ≤ r_{i} ≤ 10^6), the qualifying ranks of the finalists you know. All these ranks are distinct.


-----Output-----

Print the minimum possible number of contestants that declined the invitation to compete onsite.


-----Examples-----
Input
25
2 3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 20 21 22 23 24 25 26 28

Output
3

Input
5
16 23 8 15 4

Output
0

Input
3
14 15 92

Output
67



-----Note-----

In the first example, you know all 25 onsite finalists. The contestants who ranked 1-st, 13-th, and 27-th must have declined, so the answer is 3.

Difficulty: EASY
Tags: Implementation

Greedy algorithms
Skill types: Greedy algorithms

Starter code:

Solutions:
n = int(input())
a = list(map(int, input().split()))
q = max(a)
print(max(0, q - 25))


(m,) = map(int, input().split())
arr = list(map(int, input().split()))
print(max(0, max(arr) - 25))


n = int(input())
l = [int(x) for x in input().split()]
m = max(l)
if m <= 25:
	print('0')
else:
	print(m - 25)


__author__ = 'Dilshod'
n = int(input())
m = list(map(int, input().split()))
a = max(m)
if a < 25:
	print(0)
else:
	print(a - 25)


k = int(input())
l = list(map(int, input().split()))
print(max(0, max(l) - 25))


k = input()
arr = input()
max = 0
for item in arr.split():
	if int(item) > max:
		max = int(item)
if max - 25 > 0:
	print(max - 25)
else:
	print(0)


n = int(input())
li = list(map(int, input().split()))
a = max(li)
if a > 25:
	print(a - 25)
else:
	print(0)


n = int(input())
contestants = [int(i) for i in input().split(' ')]
contestants.sort(reverse=True)
if n <= 25 and contestants[0] > 25:
	print(contestants[0] - 25)
else:
	print(0)


n = int(input())
l = list(map(int, input().split()))
if max(l) <= 25:
	print(0)
else:
	print(max(l) - 25)


import sys
import math
import bisect

def main():
	n = int(input())
	A = list(map(int, input().split()))
	if max(A) < 25:
		print(0)
	else:
		print(max(A) - 25)
main()


from math import sqrt

def main():
	d = int(input())
	vals = [int(v) for v in input().split()]
	print(max(0, max(vals) - 25))
main()


n = int(input())
a = list(map(int, input().split()))
c = [0]
for i in a:
	if i > 25:
		c.append(i - 25)
print(max(c))


input()
print(max(max(list(map(int, input().split()))) - 25, 0))


finalists = int(input())
ranks = list(map(int, input().split()))
if max(ranks) <= 25:
	print(0)
else:
	print(max(ranks) - 25)


n = int(input())
L = list(map(int, input().split()))
ans = 0
L.sort()
print(max(0, L[-1] - 25))


n = int(input())
a = [int(i) for i in input().split()]
t = 0
for i in a:
	if i > t:
		t = i
if t > 25:
	print(t - 25)
else:
	print(0)


k = input()
l = max(map(int, input().split()))
if l > 25:
	print(l - 25)
else:
	print(0)


n = int(input())
l = [int(i) for i in input().split()]
if max(l) - 25 < 0:
	print(0)
else:
	print(max(l) - 25)


n = int(input())
m = list(map(int, input().split()))
s = max(m)
if s <= 25:
	print(0)
else:
	print(s - 25)


n = int(input())
a = [int(i) for i in input().split()]
a.sort()
if a[n - 1] <= 25:
	print('0')
else:
	print(a[n - 1] - 25)


k = int(input())
z = list(map(int, input().split()))
print(max(0, max(z) - 25))


K = int(input())
r = list(map(int, input().split(' ')))
ans = (max(r) > 25) * (max(r) - 25)
print(ans)


n = int(input())
c = map(int, input().split())
print(max(max(c) - 25, 0))


k = int(input())
r = list(map(int, input().split(' ')))
if max(r) >= 25:
	print(max(r) - 25)
else:
	print(0)


k = int(input())
arr = list(map(int, input().split()))
arr.sort()
if arr[k - 1] - 25 > 0:
	print(arr[k - 1] - 25)
else:
	print('0')


def main():
	f = int(input())
	c = list(map(int, input().split()))
	if max(c) <= 25:
		print(0)
	else:
		print(max(c) - 25)
main()


def solution(l1):
	return max(0, max(l1) - 25)

def answer():
	n = int(input())
	l1 = [int(x) for x in input().split()]
	print(solution(l1))
answer()


x = int(input())
a = list(map(int, input().split()))
if max(a) <= 25:
	exit(print(0))
print(max(a) - 25)


a = int(input())
b = list(map(int, input().split()))
if max(b) <= 25:
	print(0)
else:
	print(max(b) - 25)


def main():
	n = int(input())
	l = input().split()
	for i in range(len(l)):
		l[i] = int(l[i])
	maximum = l[0]
	for i in range(n):
		maximum = max(maximum, l[i])
	maximum -= 25
	if maximum >= 0:
		print(maximum)
	else:
		print('0')
main()


numbers = int(input())
max_number_of_finalist = 25
for i in input().split():
	max_number_of_finalist = max(max_number_of_finalist, int(i))
print(max_number_of_finalist - 25)


import sys

def main():
	k = int(sys.stdin.readline().strip())
	ranks = [int(tok) for tok in sys.stdin.readline().split()]
	print(max(max(ranks) - 25, 0))
main()


k = int(input())
l = [int(x) for x in input().split()]
l.sort()
if l[-1] > 25:
	print(l[-1] - 25)
else:
	print(0)


k = int(input())
ri = list(map(int, input().split()))
print(max(0, max(ri) - 25))


input()
m = max([int(x) for x in input().split()])
print(max(0, m - 25))


n = int(input())
l = list(map(int, input().strip().split()))
t = 0
if n == 25:
	for j in range(1, max(l)):
		if j in l:
			pass
		else:
			t += 1
	print(t)
elif max(l) > 25:
	print(max(l) - 25)
else:
	print('0')


k = int(input())
list1 = list(map(int, input().split()))
print(max(0, max(list1) - 25))


input()
X = list(map(int, input().split()))
Max = max(X) - 25
print(Max if Max >= 0 else '0')


n = int(input())
arr = [int(a) for a in input().split(' ')]
m = max(arr)
r = m - 25
if r > 0:
	print(r)
else:
	print(0)


n = int(input())
l = list(map(int, input().split()))
y = max(l)
s = y - 25
if s >= 0:
	print(s)
elif s < 0:
	print('0')


def main():
	k = int(input())
	L = [int(x) for x in input().split()]
	print(solver(k, L))

def solver(k, L):
	L.sort()
	last = L[k - 1]
	return max(last - 25, 0)
main()


def readln():
	return list(map(int, input().rstrip().split()))
n = int(input())
data = list(readln())
rs = max(data) - 25
print(0 if rs < 0 else rs)


import sys
(n, c) = [i for i in sys.stdin.read().strip().split('\n')]
n = int(n)
c = [int(i) for i in c.split()]
print(max(max(c) - 25, 0))


import sys
input = sys.stdin.readline
k = int(input())
large = max(map(int, input().split()))
print(max(0, large - 25))


n = map(int, input().split())
a = list(map(int, input().split()))
mx = max(a)
if mx <= 25:
	ans = 0
else:
	ans = mx - 25
print(ans)


import math
n = int(input())
nums = input().split()
for i in range(n):
	nums[i] = int(nums[i])
nums.sort()
if nums[n - 1] > 25:
	print(nums[n - 1] - 25)
else:
	print(0)


a = input()
t = input()
t = t.split()
g = 0
for x in t:
	if int(x) > g:
		g = int(x)
if g > 25:
	print(g - 25)
else:
	print(0)


k = int(input())
a = list(map(int, input().split()))
v = max(a)
v = max(v, 25)
print(v - 25)


k = int(input())
rs = frozenset(map(int, input().split()))
print(max(max(rs) - 25, 0))


k = int(input())
a = list(map(int, input().split()))
print(max(0, max(a) - 25))


N = input()
TMP = list(map(int, input().split()))
print(max(TMP) - 25 if max(TMP) > 25 else 0)


K = int(input())
r = list(map(int, input().split()))
m = max(r)
ans = max(0, m - 25)
print(ans)


a = int(input())
b = list(map(int, input().split()))
pivot = 25
for i in range(len(b)):
	if b[i] > pivot:
		pivot = b[i]
print(pivot - 25)


input()
List = [*map(int, input().split())]
a = max(List) - 25
if a >= 0:
	print(a)
else:
	print(0)


input()
res = max(0, max(map(int, input().split())) - 25)
print(res)


n = int(input())
k = max([int(x) for x in input().split()])
print(k - 25 if k >= 25 else 0)


k = int(input())
ls = list(map(int, input().split(' ')))
print(max(max(ls) - 25, 0))


k = int(input())
r = sorted(list(map(int, input().split())))
print(0) if r[k - 1] <= 25 else print(r[k - 1] - 25)


k = int(input())
students = list(map(int, input().split()))
answer = max(students) - 25
if answer < 0:
	print(0)
else:
	print(answer)


k = int(input())
r = map(int, input().split())
i0 = 0
ans = k - 25
for i in sorted(r):
	ans += i - i0 - 1
	i0 = i
print(max(0, ans))


k = int(input())
r = map(int, input().split())
print(max(max(r) - 25, 0))


n = int(input())
ranks = [int(x) for x in input().split(' ')]
print(max(max(ranks) - 25, 0))


import sys
numContestants = sys.stdin.readline()
values = sys.stdin.readline()
valArray = values.split(' ')
valArray = list(map(int, valArray))
last = max(valArray)
if max(valArray) > 25:
	print(max(valArray) - 25)
else:
	print(0)


def minReject(array, num):
	maxPos = 0
	for i in range(len(array)):
		if array[i] > array[maxPos]:
			maxPos = i
	RV = array[maxPos] - 25
	if RV < 0:
		RV = 0
	return RV
while True:
	try:
		case = input()
		temp = case.split(' ')
		m = int(case)
		array = input()
		array = array.rstrip().split(' ')
		for i in range(len(array)):
			array[i] = int(array[i])
		print(minReject(array, m))
	except EOFError:
		break


noOfFinalists_know = int(input())
list = [int(x) for x in input().split(' ')]
max_el = max(list)
if max_el - 25 > 0:
	print(max_el - 25)
else:
	print(0)


n = int(input())
max = 0
x = list(map(int, input().split()))
for i in range(0, n):
	if x[i] > max:
		max = x[i]
if max > 25:
	print(max - 25)
else:
	print('0')


n = int(input())
k = [int(num) for num in input().split()]
print(max(0, max(k) - 25))


def main():
	n = int(input())
	ranks = [int(_) for _ in input().split()]
	m = max(ranks)
	print(0 if m <= 25 else m - 25)
main()


n = int(input())
l = list(map(int, input().split()))
print(max(0, max(l) - 25))


import sys
k = int(input())
ranks = sorted(list(map(int, input().split())))
vacancy = 25 - k
indx = 0
declined = 0
while vacancy > 0 and indx < k:
	unknown = ranks[indx] - (ranks[indx - 1] if indx > 0 else 0) - 1
	if vacancy <= unknown:
		declined += unknown - vacancy
		vacancy = 0
	else:
		vacancy -= unknown
	indx += 1
while indx < len(ranks):
	declined += ranks[indx] - (ranks[indx - 1] if indx > 0 else 0) - 1
	indx += 1
print(declined)


n = int(input())
a = list(map(int, input().split()))
m = max(a)
print(max(0, m - 25))


K = int(input())
r = [int(i) for i in input().split()]
R = max(r)
print(max(0, R - 1 - (25 - 1)))


n = int(input())
v = input().split(' ')
max = 0
for i in v:
	ii = int(i)
	if max < ii:
		max = ii
s = max - 25
if s < 0:
	s = 0
print(s)


n = int(input())
s = input().split()
s = list(map(int, s))
s.sort()
if s[n - 1] < 25:
	print('0')
else:
	print(s[n - 1] - 25)


n = int(input())
r = list(map(int, input().split()))
m = max(r)
if m <= 25:
	print('0')
	exit()
else:
	print(m - 25)


K = int(input())
r = []
r = input().split()
r = list(map(int, r))
r.sort()
within25 = True
for rank in r:
	if rank > 25:
		within25 = False
		break
if within25:
	print(0)
else:
	declined = 0
	extra = []
	for rank in r:
		if rank >= 25:
			extra.append(rank)
	if len(extra) == 1:
		declined += extra[0] - 25
		print(declined)
	else:
		declined += extra[0] - 25
		for i in range(len(extra) - 1):
			declined += extra[i + 1] - extra[i]
		print(declined)


input()
a = list(map(int, input().split()))
s = max(a)
print(max(0, s - 25))


n = int(input())
a = set((int(x) for x in input().split()))
cur = 1
while len(a) < 25:
	if cur not in a:
		a.add(cur)
	cur += 1
aa = [0] + list(a)
aa.sort()
ans = sum((y - x - 1 for (x, y) in zip(aa, aa[1:])))
print(ans)


k = int(input())
r = [int(x) for x in input().split()]
print(max(max(r) - 25, 0))


from sys import stdin, stdout
n = int(stdin.readline())
values = list(map(int, stdin.readline().split()))
v = max(values)
sze = 25
stdout.write(str(max(0, v - sze)))


x = int(input())
y = [int(_) for _ in input().split()]
print(max(max(y) - 25, 0))


num = int(input())
last = max(map(int, input().split()))
if last <= 25:
	print(0)
else:
	print(last - 25)


3
k = int(input())
a = set(map(int, input().split()))
c = 1
while len(a) < 25:
	if c not in a:
		a.add(c)
	else:
		c += 1
b = list(a)
b.sort()
ans = 0
y = 0
for x in b:
	ans += x - y - 1
	y = x
print(ans)


t = int(input())
m = 0
sum = 0
a = list(map(int, input().split()))
m = max(a)
if m >= 25:
	print(m - 25)
else:
	print(0)


_ = input()
x = max((int(i) for i in input().split()))
if x <= 25:
	print(0)
else:
	print(x - 25)


def solve():
	n = int(input())
	l = list(map(int, input().split()))
	print(max(max(l) - 25, 0))
solve()


final = int(input())
rank = list(map(int, input().split()))
m = max(rank)
if m <= 25:
	print(0)
else:
	print(m - 25)


import sys
numberKnown = sys.stdin.readline()
rankings = sys.stdin.readline()
Known = int(numberKnown)
ranksplit = rankings.split()
maxrank = 0
for i in range(0, len(ranksplit)):
	rank = int(ranksplit[i])
	if maxrank < rank:
		maxrank = rank
numberDeclined = maxrank - 25
if numberDeclined < 0:
	numberDeclined = 0
print(numberDeclined)


k = int(input())
list_ = list(map(int, input().split()))
max_ = max(list_)
if max_ <= 25:
	print('0')
else:
	print(max_ - 25)


n = int(input())
arr = input()
a = list(map(int, arr.split()))
flag = True
for i in a:
	if i not in range(1, 26):
		flag = False
		break
if flag:
	print(0)
else:
	print(max(a) - 25)


K = int(input())
r = list(map(int, input().split()))
print(max(0, max(r) - 25))


t = int(input())
a = [int(x) for x in input().split()]
c = 0
a.sort()
m = 25
for i in range(0, t):
	if a[i] > m:
		c += a[i] - m
		m = a[i]
print(c)


n = int(input())
a = map(int, input().split())
m = max(a)
d = m - 25
if d < 0:
	print(0)
else:
	print(d)


k = int(input())
arr = list(map(int, input().split()))
print(max(0, max(arr) - 25))


k = int(input())
l = [int(i) for i in input().split()]
l.sort()
s = l[0] - 1
for i in range(1, k):
	s = s + l[i] - l[i - 1] - 1
print(max(0, s + k - 25))


n = int(input())
arr = list(map(int, input().split()))
max_ = max(arr)
if max_ - 25 <= 0:
	print(0)
else:
	print(max_ - 25)


a = int(input())
b = list(map(int, input().split()))
print(max(0, max(b) - 25))


n = int(input())
z = list(map(int, input().split()))
print(max(0, max(z) - 25))


k = int(input())
a = list(map(int, input().split()))
m = max(a)
l = []
c1 = c2 = 0
for i in a:
	if i > 25:
		l.append(i)
for i in range(1, 26):
	if i not in a:
		c1 += 1
for i in range(26, m + 1):
	if i not in a:
		c2 += 1
if k == 25:
	print(c1 + c2)
else:
	print(c2 + len(l))


n = int(input())
ranks = list(map(int, input().split()))
maxrank = max(ranks)
if maxrank <= 25:
	print(0)
else:
	print(maxrank - 25)


input()
r = map(int, input().split())
res = max(r) - 25
if res < 0:
	res = 0
print(res)


maxN = 25
n = input()
ranks = input().strip().split()
declines = 0
for rank in ranks:
	if int(rank) > maxN:
		declines = int(rank) - 25
		maxN = int(rank)
print(declines)


import sys, math
input = sys.stdin.readline
L = lambda : list(map(int, input().split()))
M = lambda : map(int, input().split())
n = int(input())
l = L()
print(max(0, max(l) - 25))


def invited(lst):
	return max(0, max(lst) - 25)
n = int(input())
a = [int(i) for i in input().split()]
print(invited(a))


n = int(input())
ai = list(map(int, input().split()))
res = True
for i in ai:
	if i <= 25:
		res = True
	else:
		res = False
		break
if res == True:
	print(0)
else:
	print(max(ai) - 25)


n = int(input())
s = input().split()
mx = 25
for i in s:
	mx = max(mx, int(i))
print(mx - 25)


import math, itertools, fractions, heapq, collections, bisect, sys, 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 I():
	return int(sys.stdin.readline())

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

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

def S():
	return input()

def main():
	I()
	l = LI()
	return max(0, max(l) - 25)
print(main())


n = int(input())
max = 1
s = input().split()
for i in range(0, len(s)):
	s[i] = int(s[i])
	if s[i] > max:
		max = s[i]
if max < 26:
	print(0)
else:
	print(max - 25)


K = int(input())
R = list(map(int, input().split()))
R.sort()
iv = [False] * (R[-1] + 1)
for r in R:
	iv[r] = True
ans = 0
for r in range(1, R[-1] + 1):
	if not iv[r] and K < 25:
		iv[r] = True
		K += 1
	if not iv[r]:
		ans += 1
print(ans)


def __starting_point():
	input()
	ar = list(map(int, input().split()))
	m = max(ar)
	if m < 25:
		print(0)
	else:
		print(m - 25)
__starting_point()


a = int(input())
b = input().split()
max = 0
for i in range(a):
	if int(b[i]) > max:
		max = int(b[i])
if max > 25:
	print(max - 25)
else:
	print(0)


num = int(input())
arr = list(map(int, input().split(' ')))
maxx = max(arr)
if maxx > 25:
	print(maxx - 25)
else:
	print(0)


k = int(input())
mas = list(map(int, input().split()))
res = 0
for i in mas:
	if i > 25 and res < i - 25:
		res = i - 25
print(res)


k = int(input())
a = list(map(int, input().split(' ')))
a.sort()
print(max(a[-1] - 25, 0))


import os
import sys
from io import BytesIO, IOBase
import math
from decimal import Decimal
from decimal import *
from collections import defaultdict, deque
import heapq
from decimal import Decimal
getcontext().prec = 25
abcd = 'abcdefghijklmnopqrstuvwxyz'
ABCD = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
MOD = 1000000007
BUFSIZE = 8192
from bisect import bisect_left, bisect_right

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')
n = int(input())
l = list(map(int, input().split(' ')))
print(max(max(l) - 25, 0))


n = int(input())
data = list(map(int, input().split()))
maximum = max(data)
ans = maximum - 25
if ans < 0:
	print('0')
else:
	print(ans)


__author__ = 'Alexander'
import sys

def Task(n, numbers):
	elem = max(numbers)
	return max(0, elem - 25)

def Main():
	n = int(input().strip())
	numbers = map(int, input().strip().split())
	outp = Task(n, numbers)
	print('{}\n'.format(outp))

def Test():
	assert Task(5, [16, 23, 8, 15, 4]) == 0
	assert Task(25, [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 28]) == 3
Main()


a = int(input())
l = list(map(int, input().split()))
mx = max(l)
if mx <= 25:
	print(0)
else:
	print(mx - 25)


n = int(input())
arr = input()
arr = arr.split(' ')
arr = list(map(int, arr))
m = -1
for c in arr:
	if c > m:
		m = c
if m <= 25:
	print(0)
else:
	print(m - 25)


K = int(input())
r = [int(x) for x in input().split()]
ans = max(r) - 25 if max(r) - 25 >= 0 else 0
print(ans)


input()
a = list(map(int, input().split()))
m = max(a)
n = len(a)
if m <= 25:
	print(0)
else:
	print(m - 25)


def solve(n, r):
	return max(0, max(r) - 25)

def main():
	n = int(input())
	r = list(map(int, input().split()))
	print(solve(n, r))
main()


n = int(input())
mx = max([int(x) for x in input().split()])
print(max(0, mx - 25))


n = input()
x = map(int, input().split())
x = max(x)
if x - 25 < 0:
	print(0)
else:
	print(x - 25)


n = int(input())
arr = list(map(int, input().split()))
print(max(0, max(arr) - 25))


input()
c = max(map(int, input().split())) - 25
if c > 0:
	print(c)
else:
	print(0)


k = int(input())
num = list(map(int, input().split(' ')))
if max(num) <= 25:
	print(0)
else:
	dentro = 0
	for a in num:
		if a <= 25:
			dentro += 1
	print(max(num) - dentro - (25 - dentro))


b = int(input())
a = list(map(int, input().split()))
b = 0
a.sort()
for i in range(b):
	if a[i] > 25:
		b += 1
if a[-1] > 25:
	b = b + (a[-1] - 25 - b)
print(b)


n = int(input())
L = input().split()
mx = 0
for i in range(n):
	L[i] = int(L[i])
	mx = max(mx, L[i])
print(max(0, mx - 25))


k = int(input())
a = list(map(int, input().split()))
t = 0
for i in range(k - 1, -1, -1):
	if a[i] > 25:
		t += 1
if max(a) <= 25:
	print(0)
else:
	print(max(a) - 25)


a = int(input())
s = list(map(int, input().split()))
maxc = s[0]
for i in range(1, len(s)):
	if s[i] > maxc:
		maxc = s[i]
print(max(maxc - 25, 0))


input()
arr = list(map(int, input().split()))
m = max(arr)
print(m - 25 if m > 25 else 0)


n = int(input())
rank = list(map(int, input().split(' ')))
m = -1
for i in rank:
	m = max(m, i)
print(max(0, m - 25))


k = int(input())
arr = [int(x) for x in input().split()]
max_ = max(arr) - 25
if max_ > 0:
	print(max_)
else:
	print(0)


a = input()
onsite = list(map(int, input().split()))
ans = max(0, max(onsite) - 25)
print(ans)


k = int(input())
a = [int(x) for x in input().split()]
print(max(0, max(a) - 25))


K = int(input())
A = [*map(int, input().split())]
print(max(0, max(A) - 25))


n = int(input())
ranks = input().split(' ')
for i in range(n):
	ranks[i] = int(ranks[i])
print(str(max(max(ranks) - 25, 0)))


import math

def main_function():
	n = int(input())
	l = [int(i) for i in input().split(' ')]
	if max(l) <= 25:
		return 0
	else:
		return max(l) - 25
print(main_function())


def main():
	K = int(input())
	R = tuple(map(int, input().split()))
	ans = max(R) - 25
	if ans <= 0:
		print(0)
	else:
		print(ans)
main()


K = int(input())
x = list(map(int, input().split()))
if max(x) > 25:
	print(max(x) - 25)
else:
	print(0)


from collections import Counter
n = int(input())
l = list(map(int, input().split()))
print(max(max(l) - 25, 0))


import math
from random import random

def getInt():
	return int(input())

def getInts():
	line = input().split()
	return [int(l) for l in line]

def getFloat():
	return float(input())

def getFloats():
	line = input().split()
	return [float(l) for l in line]

def getStrings():
	line = input().split()
	return line
K = getInt()
ns = getInts()
maxRank = max(ns)
if maxRank <= 25:
	print(0)
else:
	print(maxRank - 25)


n = int(input().rstrip())
a = max(list(map(int, input().rstrip().split(' '))))
print(max(0, a - 25))


numberk = int(input())
lists = list(map(int, input().split()))
y = max(lists)
if y - 25 > 0:
	print('{}'.format(y - 25))
else:
	print('0')


def declined(known, ranks):
	known = int(known)
	ranks = [int(x) for x in ranks]
	ranks.sort()
	if known >= 25:
		prev = 0
		declined = 0
		for rank in ranks:
			rank = int(rank)
			diff = rank - prev
			if diff > 1:
				declined += diff - 1
			prev = rank
		return declined
	prev = 25
	declined = 0
	l25 = True
	for rank in ranks:
		rank = int(rank)
		if rank > 25:
			l25 = False
			declined += rank - prev
			prev = rank
	if l25:
		return 0
	return declined
k = input()
r = input().strip().split(' ')
print(declined(k, r))


k = int(input())
a = [int(i) for i in input().split()]
an = max(a) - 25
if an <= 0:
	print(0)
else:
	print(an)


def min_possible(arr):
	x = max(arr)
	return max(0, x - 25)
n = int(input().strip())
arr = list(map(int, input().strip().split()))
print(min_possible(arr))


k = int(input())
r = input().split(' ')
for i in range(0, k):
	r[i] = int(r[i])
r.sort()
ans = 0
prev = 0
for i in range(0, k - 1):
	ans += r[i + 1] - r[i] - 1
	prev = r[i]
ans += r[0] - 1
result = ans - (25 - k)
if result <= 0:
	print(0)
else:
	print(result)


n = int(input())
dat = list(map(int, input().split()))
maxx = 0
for i in range(len(dat)):
	maxx = max(maxx, dat[i])
print(max(0, maxx - 25))


IL = lambda : list(map(int, input().split()))
n = int(input())
R = IL()
print(max(max(R) - 25, 0))


K = int(input())
R = list(map(int, input().split()))
R.sort()
if R[-1] >= 25:
	print(R[-1] - 25)
else:
	print('0')


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

def solve(case_no):
	n = int(input())
	a = list(map(int, input().split()))
	a = sorted(a)
	print(max(0, a[n - 1] - 25))
t = 1
for i in range(1, t + 1):
	solve(i)


k = int(input())
r = [int(x) for x in input().split()]
m = max(r)
if m < 26:
	print(0)
else:
	print(m - 25)


k = int(input())
r_line = input().split()
r = list(map(int, r_line))
r = sorted(r)
max = r[k - 1]
ans = 0 if max <= 25 else max - 25
print(ans)


n = int(input())
l = list(map(int, input().split()))
m = 0
for i in range(n):
	m = max(m, l[i])
print(max(0, m - 25))


n = int(input())
p = 0
t = input()
t = t.split(' ')
for x in t:
	p = max(p, int(x))
print(max(0, p - 25))


k = int(input())
b = input().strip().split()
b = [int(i) for i in b]
a = max(b)
print(max(0, a - 25))


a = int(input())
z = input()
m = [int(i) for i in z.split()]
mm = max(m)
if mm <= 25:
	print(0)
else:
	print(mm - 25)


t = int(input())
s = [int(x) for x in input().split(' ')]
if max(s) >= 25:
	result = min(max(s) - t, max(s) - 25)
else:
	result = 0
print(result)


n = int(input())
numbers = sorted([int(i) for i in input().split()])
count_within = 0
for i in numbers:
	if i <= 25:
		count_within += 1
if count_within == n:
	print(0)
else:
	min_count = n - count_within
	curr_highest = 25
	for i in numbers[count_within:]:
		if i - curr_highest - 1 > 0:
			min_count += i - curr_highest - 1
		curr_highest = i
	print(min_count)


N = int(input())
L = list(map(int, input().split(' ')))
B = max(L)
if B - 25 < 0:
	print('0')
else:
	print(B - 25)


input()
print(max(25, max(map(int, input().split()))) - 25)


s = int(input())
l = list(map(int, input().split()))
l.sort(reverse=True)
if l[0] < 25:
	print(0)
	exit()
print(l[0] - 25)


K = int(input())
last = max(map(int, input().split()))
print(max(0, last - 25))


k = int(input())
ar = list(map(int, input().split()))
print(max(max(ar) - 25, 0))


import sys
n = int(input())
num = list(map(int, input().split()))
print(max(max(num) - 25, 0))


def main():
	n = int(input())
	a = [int(x) for x in input().split()]
	largest = max(a)
	print(max(largest - 25, 0))
main()


n = int(input())
a = [int(s) for s in input().split(' ')]
print(max(max(a) - 25, 0))


n = int(input())
l = list(map(int, input().split()))
l.append(25)
l.sort()
ans = 0
for i in range(len(l)):
	if l[i] > 25:
		ans += l[i] - l[i - 1]
print(ans)


k = int(input())
rs = set(map(int, input().split(' ')))
for i in range(25 - k):
	for j in range(1, 10000000):
		if j not in rs:
			rs.add(j)
			break
print(max(rs) - 25)


k = int(input())
a = list(map(int, input().split()))
c = max(a)
if c <= 25:
	print(0)
else:
	print(c - 25)


n = int(input())
e = 25 - n
a = [int(i) for i in input().split()]
i = 1
while e > 0:
	if i not in a:
		a.append(i)
		e = e - 1
		i = i + 1
	else:
		i = i + 1
f = 0
for i in range(1, max(a) + 1):
	if i not in a:
		f = f + 1
print(f)


n = int(input())
p = [*map(int, input().split())]
print(0 if max(p) - 25 < 0 else max(p) - 25)


n = int(input())
a = [int(x) for x in input().split()]
mx = max(a)
if mx <= 25:
	print(0)
else:
	print(mx - 25)


a = int(input())
b = input().split()
b = [int(x) for x in b]
if max(b) - len(b) - (25 - a) > 0:
	print(max(b) - len(b) - (25 - a))
else:
	print(0)


n = int(input())
coders = sorted(list(map(int, input().split())))
first_25 = [i for i in coders if i <= 25]
others = [25] + coders[len(first_25):]
current = others[0]
ans = 0
if len(coders) == 25:
	print(coders[-1] - 25)
else:
	for i in range(1, len(others)):
		ans += others[i] - others[i - 1]
	print(ans)


n = int(input())
a = map(int, input().split())
res = max(0, max(a) - 25)
print(res)


T = int(input())
A = [int(x) for x in input().split()]
print(0 if max(A) <= 25 else max(A) - 25)


input()
part = list(map(int, input().split()))
if max(part) > 25:
	q = max(part) - 25
	print(q)
else:
	print(0)


n = int(input())
s = input()
s = s.split()
s = list(map(int, s))
print(max(0, max(s) - 25))


a = int(input())
d = input()
finalists = []
for veri in d.split(' '):
	finalists.append(int(veri))
print(max(max(finalists) - 25, 0))


k = int(input())
print(max(0, max([int(i) for i in input().split()]) - 25))


input()
ar = map(int, input().split())
m = max(ar)
if m < 25:
	print(0)
else:
	print(m - 25)


n = int(input())
arr = list(map(int, input().split()))
if max(arr) <= 25:
	print(0)
else:
	x = n
	if 1 not in arr:
		arr.append(0)
		x += 1
	ans = 0
	arr.sort()
	for i in range(1, x):
		ans += arr[i] - arr[i - 1] - 1
	print(ans - (25 - n))


n = int(input())
ls = list(map(int, input().split(' ')))
mx = max(ls)
if mx > 25:
	print(mx - 25)
else:
	print(0)


n = int(input())
a = sorted(list(map(int, input().split())))
if a[-1] <= 25:
	print(0)
else:
	print(abs(a[-1] - 25))


k = int(input())
a = list(map(int, input().split()))
maxi = 0
for i in range(k):
	maxi = max(maxi, a[i])
print(max(0, maxi - 25))


kostyl = int(input())
finalists = input().split()
for i in range(kostyl):
	finalists[i] = int(finalists[i])
if sorted(finalists)[kostyl - 1] > 25:
	print(sorted(finalists)[kostyl - 1] - 25)
else:
	print(0)