Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"sort"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() int {
	scanner.Scan()
	i, e := strconv.Atoi(scanner.Text())
	if e != nil {
		panic(e)
	}
	return i
}
func main() {
	scanner.Split(bufio.ScanWords)
	nums := make([]int, 5)
	for i := 0; i < 5; i++ {
		nums[i] = nextInt()
	}
	sort.Sort(sort.Reverse(sort.IntSlice(nums)))
	for i, v := range nums {
		if i == len(nums)-1 {
			fmt.Printf("%d\n", v)
		} else {
			fmt.Printf("%d ", v)
		}
	}
}

Python: print(' '.join(map(str, sorted(list(map(int, input().split())), reverse=True))))

Python: print(' '.join(map(str, sorted(map(int, input().split()), reverse=True))))

Python: print(' '.join(map(str, reversed(sorted(input().split())))))

Python: s = list(map(int,input().split()))
print(*sorted(s)[::-1])

Python: def sort(num):
   l = len(num)
   for i in range(0,l):
        for j in range(0,l-i-1):
            if num[j] < num[j+1]:
               temp = num[j]
               num[j] = num[j+1]
               num[j+1]=temp
   print(num[0],end='')
   for i in range(1,len(num)):
       print('',num[i],end='')

a , b , c , d , e = map(int,input().split())
num = []
num.append(a)
num.append(b)
num.append(c)
num.append(d)
num.append(e)
sort(num)

Python: def run():
    numbers = sorted(list(map(int, input().split())), reverse=True)
    print(' '.join([str(n) for n in numbers]))

if __name__ == '__main__':
    run()

Python: a=sorted([int(i) for i in input().split()],reverse=True)
print(" ".join([str(i) for i in a]))

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

import sys
import os

lst = list(map(int, input().split()))
lst.sort(reverse=True)

print(*lst)

Python: a = list(map(int,input().split()))
a.sort(reverse = True);

print(*a)

Python: l = sorted(map(int, input().split()), reverse=True)
print(' '.join(map(str, l)))

Python: l = [int(i) for i in input().split()]
l.sort()
l.reverse()
print(' '.join([str(i) for i in l]))

Python: s = list(map(int, input().split()))
s.sort(reverse = True)
print(*s)

Python: print(*sorted(map(int,input().split()))[::-1])

Python: print(" ".join(str(e) for e in sorted(list(map(int,input().split())))[::-1]))

Python: a=input().split(" ")
a.sort(reverse=True)
' '.join(a)

Python: import sys
import math as mas

print(*reversed(sorted(list(map(int,input().split())))))

#for i in sys.stdin:
#	a,b=map(int,i.split())
#	print(gcd(a,b),lcm(a,b))

Python: #coding:utf-8

l = map(int, raw_input(). split())
l.sort()
l.reverse()
for i in xrange(len(l)):
    print(l[i]),

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

data = input()
n = [0]*5
n[0],n[1],n[2],n[3],n[4] = map(int,data.split(' '))

count = 0
while True:
    for i in range(len(n)-1):
        if n[i] < n[i+1]:
            tmp = n[i]
            n[i] = n[i+1]
            n[i+1] = tmp
    count += 1
    if count == 5:
        break

for i in range(len(n)-1):
    print(n[i],end=' ')

print(n[len(n)-1])

Python: print(" ".join(map(str, sorted(list(map(int, input().split())), reverse = True))))

Python: print(*sorted(map(int, input().spilt()))[::-1])

Python: numlist = [eval(item) for item in input().split()]
numlist.sort()
numlist.reverse()
for item in numlist:
	print(item, end = ' ')

Python: s = list(map(int, input().split()))
s.sort(reverse=1)
for i in range(4):
    print(s[i], end=" ")
print(s[4])

Python: def main():
    numbers = map(int, input().split())
    numbers = sorted(numbers, reverse=True)
    print(*numbers)

if __name__ == "__main__":
    main()

Python: a = list(map(int, input().split()))
a.sort()
print(*a[::-1])

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

def main():
    LIST=input().split()
    LIST.sort(reverse=True)
    map(int(),LIST)
    print("{0} {1} {2} {3} {4}".format(LIST[0],LIST[1],LIST[2],LIST[3],LIST[4]))
        
if __name__ == '__main__':
    main()

Python: s=list(map(int, input().split()))
s.sort()

for i in s:
    print(str(i), end="")
    if i != s[-1]:
        print(" ", end="")

print()

Python: a=input().split(" ")
a.sort()
for i in a[::-1]:
    print(str(i),end=" ")

Python: print(" ".join(sorted(input().split(), reverse = True)))

Python: import sys
import math as mas

a=list(map(int,input().split()))
a.sort()
a.reverse()
print(*a)

#for i in sys.stdin:
#	a,b=map(int,i.split())
#	print(gcd(a,b),lcm(a,b))

Python: print(' '.join(map(str, sorted(map(int, input().split()), reverse=True))))

Python: a = sorted(list(map(int, input().split())), reverse=True)
print(' '.join(map(str, a)))

Python: import sys

line = sys.stdin.readline()
line = line.split(" ")
inp = []
for i in line:
    inp.append(int(i))
inp.sort()
inp.reverse()
for i in inp:
    if inp.index(i)<len(inp)-1:
        print (i, end=" ")
    else:
        print (i)

Python: if __name__ == '__main__':

	print(*sorted(map(int,input().split()),reverse=True))

Python: import sys
from functools import reduce
l = sorted(map(int,sys.stdin.readline().rstrip().split(' ')))[::-1]
print(' '.join(map(str,l)))

Python: 

list = list(map(int,input().split(' ')))
list.sort(reverse = True);

print(*list)

Python: print(' '.join(map(str,sorted(list(map(int,input().split())))[::-1])))

Python: if __name__ == '__main__':
    # ??????????????\???
    data = [int(x) for x in input().split(' ')]

    # ??´????????????
    data.sort(reverse=True)

    # ???????????????
    print(*data)

Python: # AOJ 0018 Sorting Five Numbers
# Python3 2018.6.11 bal4u

a = list(map(int, input().split()))
a.sort()
print(*a[::-1])

Python: user = input()
a = []
b = []
b = user.split()
for i in range(5):
    a.append(int(b[i]))
for j in range(4):
    for k in range(j+1, 5):  # j<k
        if a[j] < a[k]:
            tmp = a[j]
            a[j] = a[k]
            a[k] = tmp

for j in range(5):
    print(str(a[j]), end=" ")
print("")

Python: n = map(int, raw_input().split())
n.sort(reverse = True)
for i in range(len(n)):
    print(n[i]),
print

Python: # coding=utf-8

###
### for atcorder program
###

import sys
import math

# math class
class mymath:
    ### pi
    pi = 3.14159265358979323846264338

    ### Prime Number
    def pnum_eratosthenes(self, n):
        ptable = [0 for i in range(n+1)]
        plist = []

        for i in range(2, n+1):
            if ptable[i]==0:
                plist.append(i)
                for j in range(i+i, n+1, i):
                    ptable[j] = 1
        return plist

    ### GCD
    def gcd(self, a, b):
        if b == 0:
            return a
        return self.gcd(b, a%b)

    ### LCM
    def lcm(self, a, b):
        return (a*b)//self.gcd(a,b)

    ### Mat Multiplication
    def mul(self, A, B):
        ans = []
        for a in A:
            c = 0
            for j, row in enumerate(a):
                c += row*B[j]
            ans.append(c)
        return ans

mymath = mymath()

### output class
class output:
    ### list
    def list(self, l):
        l = list(l)
        #print(" ", end="")
        for i, num in enumerate(l):
            print(num, end="")
            if i != len(l)-1:
                print(" ", end="")
        print()

output = output()

### input sample
#i = input()
#N = int(input())
#A, B, C = [x for x in input().split()]
#N, K = [int(x) for x in input().split()]
#inlist = [int(w) for w in input().split()]

#R = float(input())
#A.append(list(map(int,input().split())))

#for line in sys.stdin.readlines():
#    x, y = [int(temp) for temp in line.split()]

#abc list
#abc = [chr(ord('a') + i) for i in range(26)]

### output sample
#print("{0} {1} {2:.5f}".format(A//B, A%B, A/B))
#print("{0:.6f} {1:.6f}".format(R*R*math.pi,R*2*math.pi))
#print(" {}".format(i), end="")

def get_input():
    N = []
    while True:
        try:
            #N.append(input())
            N.append(int(input()))
        except EOFError:
            break
    return N

N = [int(x) for x in input().split()]
N = sorted(N)

S = ''

for i in N[::-1]:
    S += str(i)+' ' 

print(S[:-1])

Python: Num = list(map(int,input().split()))
Num.sort()
Num = Num[::-1]
for i in range(len(Num)):
    print(Num[i],end = ' ')