insertion sort
//I Love Java
import java.util.*;
import java.io.*;
import static java.util.stream.Collectors.toList;
import java.util.stream.*;
public class Insertion_Sort_P {
public static void main(String[] args) throws IOException {
BufferedReader buffer = new BufferedReader(new InputStreamReader(System.in));
List<Integer> arr = Stream.of(buffer.readLine().replaceAll("\s+$", " ").split(" ")).map(Integer::parseInt)
.collect(toList());
insertion_sort(arr);
System.out.println(arr);
}
public static void insertion_sort(List<Integer> arr) {
for (int i = 1; i <= arr.size() - 1; i++) {
steps(arr, i);
}
}
public static void steps(List<Integer> arr, int comp) {
for (int i = 0; i <= comp - 1; i++) {
if (arr.get(comp) < arr.get(i)) {
swap(arr, i, comp);
}
}
}
static void swap(List<Integer> arr, int i, int j) {
int temp = arr.get(i);
arr.set(i, arr.get(j));
arr.set(j, temp);
}
}