백준_BruteForce_일곱 난쟁이

key = []
for i in range(9):
    key.append(int(input()))
    
def findtwo(key):
    for i in range(len(key)):
        for j in range(len(key)):
            if i == j:
                continue
            if sum(key) - key[i] - key[j] == 100:
                return (key[i], key[j])
            
del1, del2 = findtwo(key)
key.remove(del1)
key.remove(del2)
key = sorted(key)

for k in key:
    print(k)