def quickSort(ar, left, right):
    key = ar[int((left + right) / 2)]
    l = left
    r = right
    while left <= right:
        while ar[left] < key:
            left += 1
        while ar[right] > key:
            right -= 1
        if left <= right:
            ar[left], ar[right] = ar[right], ar[left]
            left, right = left + 1, right - 1
    if(l < right):
        quickSort(ar, l, right)
    if(left < right):
        quickSort(ar, left, r)
    return ar
 
 
import json
import sys
 
array = json.load(sys.stdin)
print(quickSort(array, 0, len(array) - 1))

ZGVmIHF1aWNrU29ydChhciwgbGVmdCwgcmlnaHQpOgogICAga2V5ID0gYXJbaW50KChsZWZ0ICsgcmlnaHQpIC8gMildCiAgICBsID0gbGVmdAogICAgciA9IHJpZ2h0CiAgICB3aGlsZSBsZWZ0IDw9IHJpZ2h0OgogICAgICAgIHdoaWxlIGFyW2xlZnRdIDwga2V5OgogICAgICAgICAgICBsZWZ0ICs9IDEKICAgICAgICB3aGlsZSBhcltyaWdodF0gPiBrZXk6CiAgICAgICAgICAgIHJpZ2h0IC09IDEKICAgICAgICBpZiBsZWZ0IDw9IHJpZ2h0OgogICAgICAgICAgICBhcltsZWZ0XSwgYXJbcmlnaHRdID0gYXJbcmlnaHRdLCBhcltsZWZ0XQogICAgICAgICAgICBsZWZ0LCByaWdodCA9IGxlZnQgKyAxLCByaWdodCAtIDEKICAgIGlmKGwgPCByaWdodCk6CiAgICAgICAgcXVpY2tTb3J0KGFyLCBsLCByaWdodCkKICAgIGlmKGxlZnQgPCByaWdodCk6CiAgICAgICAgcXVpY2tTb3J0KGFyLCBsZWZ0LCByKQogICAgcmV0dXJuIGFyCgoKaW1wb3J0IGpzb24KaW1wb3J0IHN5cwoKYXJyYXkgPSBqc29uLmxvYWQoc3lzLnN0ZGluKQpwcmludChxdWlja1NvcnQoYXJyYXksIDAsIGxlbihhcnJheSkgLSAxKSk=

WzIsMCwxXQ==

[2,0,1]