Go: package main

import "fmt"

func main() {
	var height int
	topHeights := [5]int{}

	for i := 0; i < 10; i++ {
		fmt.Scan(&height)

		for j := 0; j < 3; j++ {
			if topHeights[j] < height {
				topHeights[j+2] = topHeights[j+1]
				topHeights[j+1] = topHeights[j]
				topHeights[j] = height
				break
			}
		}
	}

	for i := 0; i < 3; i++ {
		fmt.Println(topHeights[i])
	}
}

Python: arr = []
for i in range(10):
	arr=arr+[int(raw_input())]
arr.sort()
arr.reverse()
for i in range(3):
	print(arr[i])

Python: a=[]
for i in range(10):
    a.append(int(input()))
for i in range(3):
    c = 0
    for sample in a:
        if c < sample:
            c = sample
    print(c)
    a.remove(c)

Python: l = []
for i in range(10):
    l.append(int(input()))

l = sorted(l, reverse=True)
for i in range(3):
    print(l[i])

Python: [print(x) for x in sorted([int(input()) for _ in range(10)], reverse=True)[0:3]]

Python: arr = []
for i in range(10):
    arr.append(int(input()))
arr.sort()
arr.reverse()
for i in range(3):
    print(arr[i])

Python: h = []
for i in range(10):
    h.append(int(input()))
h.sort()
print(h[9])
print(h[8])
print(h[7])

Python: l = []
for i in range(10):
    l.append(int(input()))
l.sort()
for i in range(3):
    print(l[9-i])

Python: l=[]
for i in range(10):
	l.append(int(input()))
l.sort().reverse()
print(l[0])
print(l[1])
print(l[2])

Python: h=sorted([int(input()) for i in range(10)],reverse=True)
for i in range(3):
    print(h[i])

Python: mountains = []
[mountains.append(int(input())) for i in range(10)]
mountains = sorted(mountains)[::-1]
for j in range(3):
    print(mountains[j])

Python: import fileinput

mountains = []
for cnt in range(10):
#    for line in fileinput.input():
    a = input()
    mountains.append(int(a))
mountains.sort()
print(mountains[9])
print(mountains[8])
print(mountains[7])

Python: x = []
for i in range(3):
	x.append(input())
x.sort()
for j in range(-1,-4,-1):
	print(x[j])

Python: a = [int(input()) for i in range(10)]

a.reverse()
for i in range(3): 
    print(a[i])

Python: 
mountains = []

for i in range(10):
    mountains.append(int(input()))

mountains.sort(reverse = True)

for i in range(3):
    print(mountains[i])

Python: # -*- coding:utf-8 -*-

first = 0
second = 0
third = 0
i = 0

for i in range(0,9):
    line = int(input())
    
    if first < int(line):
        third = second
        second = first
        first = int(line)
    elif second < int(line):
        third = second
        second = int(line)
    elif third < int(line):
        third = int(line)
print(first)
print(second)
print(third)

exit()

Python: def ListofTopHills():
    h=[]
    for i in range(10):
        h.append(int(input()))
    h=sorted(h)

    for i in range(3):
        print(h[9-i])
        
ListofTopHills()

Python: x=[]
for i in range(10):
    s=int(input())
    x.append(int(s))

y=sorted(x)
print(y[9])
print(y[8])
print(y[7])

Python: h_list = []
for i in range(0,10):
    h_input = int(input())

    if (0 <= h_input <= 10000):
        h_list.append(h_input)


h_list = sorted(h_list, reverse=True)

for i in range(0,3):
    print(h_list[i])

Python: #!/usr/bin/env python3
#coding: utf-8

# Volume0 - 0001 (http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0001)

li = []
for x in range(10):
    y = input()
    li.append(y)

li.sort()
li.reverse()

for y in range(3):
    print(li[y])

Python: try:
    meters = []
    while True:
        meters.append(int(input().strip()))
except EOFError:
    meters.sort(reverse=True)
    for i in range(3):
        print(meters[i])

Python: hills = []
for i in range(10):
    hills.append(int(input()))
hills.sort(reverse=True)
print(hills[0])
print(hills[1])
print(hills[2])

Python: mountain=[]
for s in range(0,10):
    mountain.append(int(input()))
mountain.sort(reverse=True)
for s in range(0,3):
 print(mountain[s])

Python: #!/usr/bin/env python3
#coding: utf-8

# Volume0 - 0001 (http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0001)

li = []
for x in range(3):
    s = input()
    s = int(s)
    li.append(s)

li.sort()
li.reverse()

for y in range(3):
    print(li[y])

Python: a = []
for i in range(10):
    a.append(int(input()))
a.sort()
for j in range(3):
    print(a[-(j+1)])

Python: import numpy as np
from numpy.random import *

def quicksort(array):
    if len(array) < 2:
        return array # ?????¬??±??????
    else:
        pivot = array[0] # ?????°??±??????
        # ???????????????????°???????????????????????????¨?????????
        less = [i for i in array[1:] if i <= pivot]

        # ????????????????????§??????????????????????????¨?????????
        greater = [i for i in array[1:] if i > pivot]

        return quicksort(less) + [pivot] + quicksort(greater)


array = randint(1, 1000, 10) 
sorted_array = quicksort(array)
print(sorted_array[2])
print(sorted_array[1])
print(sorted_array[0])

Python: a = []
for i in range(10):
    a.append(int(input()))

a.sort(reverse = True)
for i in range(3):
    print(a[i])

Python: main = (lambda a: [print(i) for i in a[:3]])(sorted([int(input()) for i in range(10)])[::-1])

Python: ls = []
for i in range(0,10):
    ls.append(int(input()))
ls.sort()
print(ls[9])
print(ls[8])
print(ls[7])

Python: int_list = []
for num in range(10):
    int_line = int(input())
    int_list.append(int_line)
int_list.sort()
print(int_list[9])
print(int_list[8])
print(int_list[7])

Python: 
array = []
for i in range(10):
    num = int(input())
    array.append(num)

list = sorted(array)
print(list[9])
print(list[8])
print(list[7])

Python: a=[]

for i in range (10):
    c=int(input())
    a.append(c)
    d=sorted(a)

print(d[-1])
print(d[-2])
print(d[-3])

Python: mountainList = []

for i in range(10):
    mountainList.append(int(input()))

mountainList.sort(reverse=True)
for i in range(3):
    print(mountainList[i])

Python: max = 0
middle = 0
small = 0
x = 0
for i in range(10):
	x = int(input())
	if max < x :
		middle = max
		max = x
		x = 0
	elif middle < x :
		small = middle
		middle = x
		x = 0
	elif small < x :
		small = x
		x = 0
print(max)
print(middle)
print(small)

Python: import sys

def qsort(seq):
    if seq == []:
        return seq
    return qsort([x for x in seq[1:] if x < seq[0]]) + seq[0:1] + qsort([x for x in seq[1:] if x >= seq[0]])

data_set = []

for i in range(0, 10):
    data_set.append(int(input()))

rank = qsort(data_set)

for i in range(0,3):
    print(rank.pop(-1))

Python: # -*- coding:utf-8 -*-

first = 0
second = 0
third = 0
i = 0

for i in range(0,9):
    line = int(input())
    
    if first < int(line):
        third = second
        second = first
        first = int(line)
    elif second < int(line):
        third = second
        second = int(line)
    elif third < int(line):
        third = int(line)

print(first)
print(second)
print(third)

Python: import sys
heights = sorted([ int(h) for h in sys.stdin],reverce)
for h in heights:
    print(h)

Python: s = [int(input()) for i in range(10)]
s.sort(reverse = True)
for i in s[:3]:
    print(i)

Python: spam=[]
for i in range(10):
    spam.append(int(input()))

spam.sort()
print(spam[-1])
print(spam[-2])
print(spam[-3])

Python: def solve():
    from sys import stdin
    f_i = stdin
    
    M = list(int(f_i.readline()) for m in range(10))
    M.sort(reverse=True)
    print(*M[:3], sep='\n')

solve()

Python: height = []
while True:
    try:
        line = raw_input("")
    except EOFError:
        break
    height.append(int(line))
sorted(height)[:3]

Python: N = input()
a = []
for i in range(N):
    a.append(input())
for i in range(3):
    m = max(a)
    a.remove(m)
    print (m)

Python: inputList = []
while True:
    try:
        num = int(input())
    except EOFError:
        break
    inputList.append(num)

inputList.sort()
length = len(inputList)
for i in range(3):
    print(inputList[length - i - 1])

Python: h_list = []
for i in range(10):
    h = int(input())
    h_list.append(h)
h_list = sorted(h_list, reverse=True)
for i in range(3):
    print(h_list[i])