# Python program to sort the array by quicksort.
# First we make a function called arranged.
def arranged(array,start,end):
    
    # Now we can select the first element as pivot number.
    # And select the second element from the left.
    # And select the last element from the right.
    pivot=array[start]
    left=start+1
    right=end
    # Now we can separate the element on the basis of the pivot number.
    # Now we can apply the condition that if the number is less than the pivot number they will be swap to the left side and greater than the pivot number then we will swap the number from the right side.
    while True:
        while left<=right and array[left]<=pivot:
            left+=1
        while left<=right and array[right]>pivot:
            right-=1
    
        # Then we will swap the element
        if right<left:
            break
        else:
            array[left],array[right]=array[right],array[left]
            
    array[start],array[right]=array[right],array[start]
    return right
 
# Now we can cut the array
def part(array,start,end):
    if start<end:
        locked=arranged(array,start,end)   
        part(array,start,locked-1)
        part(array,locked+1,end)
# Now we take the array from the user.
# Now we will find the length of an array.
# Now we will run the part function.
# And, Finally we will print the sorted array.
array=list(map(eval,input("Enter the array:").split()))
al=len(array)
part(array,0,al-1)
print(array)
# Made by Ankur Patel