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: interview

Starter code:

Solutions:
input()
a = list(map(int, input().split()))
s = max(a)

print(max(0, s - 25))


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


import sys
#sys.stdin=open("data.txt")
input=sys.stdin.readline

k=int(input())

large=max(map(int,input().split()))

print(max(0,large-25))

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


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

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)


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


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

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


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


n = int(input())
a = list(map(int, input().split()))

m = max(a)
print(max(0, m-25))

#A
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)

#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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


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)


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

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)


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)))

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


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))

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))


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

__starting_point()

k = int(input())
a = list(map(int, input().split()))
c = max(a)
if c <= 25:
    print(0)
else:
    print(c - 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))


K = int(input())
r = [int(i) for i in input().split()]

R = max(r)
print(max(0, R-1-(25-1)))