960 B | 960 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
# sys.setrecursionlimit(10**7)
BLANK = " "
# inp = input
inp = lambda : sys.stdin.readline().rstrip()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
p = print
def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)
def solve():
n = ii()
l = mii()
last_cleanup = 0
ans = 0
for i in range(1, 366):
dirty_sum = 0
for dirty in l:
if dirty <= last_cleanup or i < dirty:
continue
dirty_sum += i - dirty
if dirty_sum >= 20:
last_cleanup = i - 1
ans += 1
dirty_sum = 0
for dirty in l:
if dirty <= last_cleanup:
continue
dirty_sum += 1
if dirty_sum > 0:
ans += 1
p(ans)
if __name__ == "__main__":
tc = 1
for t in range(1, tc+1):
ret = solve()