def t(n,m,k):

return max(n,m,k) < n + m + k - max(n,m,k)

def f(A,x):

return not (t(x,11,16) == ((not(max(x,5) > 10))) and t(4,A,x))

for A in range(1000):

if all (f(A,x) for x in range(1000)):

print(A)

def TR(x,y,z):

m=[x,y,z]

m.sort()

if m[0]+m[1] > m[-1]: return True

else: return False

res = []

for A in range(1,300):

Fl=1

for x in range (1,300):

f = not((TR(x,11,16)==(not(max(x,5)>10))) and (TR(4,A,x)))

if f==0:

Fl=0

if Fl==1:

res.append(A)

print(max(res))