def multiples(k):
    L=[]
    for i in range(11):
        L.append(i*k)
    return L

T=[]
for k in range(11):
    T.append(multiples(k))

def factorielle(n):
    p=1
    for k in range(1,n+1):
        p*=k
    return p

def produit(L,G):
    n=len(L)
    P=[]
    for k in range(n):
        P.append(L[k]*G[k])
    return P

def jonction (L,G):
    I=[]
    n=len(L)
    for k in range(n):
        I.append(L[k])
        I.append(G[k])
    return(I)

def partial_reverse(L,a,b):
    I=L
    for k in range(a,b+1):
        I[k]=L[b+a-k]
    return I

L=[5]
u=5
for k in range(100):
    u=(3*u-1)/4
    L.append(u)

def subdivision(a,b,n):
    L=[a]
    for k in range(n):
        L.append(a+(k+1)*(b-a)/n)
    return(L)

def carres(L):
    G=[]
    n=len(L)
    for k in range(n):
        G.append(L[k]**2)
    return(G)

def nb_positions_egalite(L,G):
    i=0
    n=len(L)
    for k in range(n):
        if L[k]==G[k]:
            i+=1
    return i

def est_arithmetique(L):
    n=len(L)
    a=L[1]-L[0]
    t=True
    for k in range(1,n-1):
        b=L[k+1]-L[k]
        if a!=b:
            t=False
    return t

def diviseurs(n):
    D=[1]
    for d in range(2,n+1):
        if n%d==0:
            D.append(d)
    return(D)

def gd_nb_div(L):
    n=len(diviseurs(L[0]))
    a=L[0]
    for k in range(len(L)):
        K=diviseurs(L[k])
        if len(K)>n:
            n=len(K)
            a=L[k]
    return a

def est_premier(n):
    L=diviseurs(n)
    t=False
    if len(L)==2:
        t=True
    return t

s=0
for k in range(2,10):
    if est_premier(k):
        s+=k

x,y,z=0,0,0
for a in range(1,998):
    for b in range(1, 999-a):
        c=1000-a-b
        if a**2+b**2==c**2:
            x,y,z=a,b,c






