def merge_sort(list):
    left = []
    right = []
    l = len(list)
    for i in range(0,l,1):
        if i < l/2:
            left.append(list[i])
        else:
            right.append(list[i])
    left = merge_sort(left)
    right = merge_sort(right)
    return merge(left,right)
def merge(left,right):
    result = []
    ll = len(left)
    rl = len(right)
    i = 0
    j = 0
    while i < ll and j < rl:
        if left[i] < right[i]:
            result.append(left[i])
            i += 1
        else:
            result.append(right[j])
            j += 1
    while i < ll:
        result.append(left[i])
        i += 1
    while j < rl:
        result.append(right[j])
        j += 1
    return result
list = [int(x) for x in input().split()]
print(merge_sort(list))