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

def t(n,m,k):

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

def f(A,x):

return t(x,10,20) <= (not((max(x,8) > 24)) == (not t(3,A,x)))

for A in range(1000):

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

print(A)

def F (a,b,c):

if ((a+b)>c) and ((a+c)>b) and ((c+b)>a):

return 1

else:

return 0

for a in range (150,0,-1):

k=0

for x in range (1,1501):

if not((F(x,10,20)==(not(max(x,8)>24))) and F(3,a,x)):

k+=1

else:

break

if k==1500:

print(a)

break

def F (a,b,c):

m=[a,b,c]

m.sort()

if (m[0]+m[1] > m[2]):

return 1

else:

return 0

for a in range(1,100):

fl=1

for x in range(10000):

f=(F(x,10,20) <= (max(x,8)<=24))== (not(F(3,a,x)))

if f==0:

fl=0

break

if fl:

print(a)