def bigSorting(unsorted): # Write your code here

unsorted_1 = []
unsorted_2 = []
for i in unsorted:
    if len(i) <= 31:
        unsorted_1.append(i)
    else:
        unsorted_2.append(i)

n = len(unsorted_2)
for i in range(n-1, 0, -1):
    for j in range(i):
        if len(unsorted_2[j]) > len(unsorted_2[i]) or (len(unsorted_2[j]) == len(unsorted_2[i]) and unsorted_2[j] > unsorted_2[i]):
            unsorted_2[i], unsorted_2[j] = unsorted_2[j], unsorted_2[i]

return list(map(str, sorted(list(map(int, unsorted_1))))) + unsorted_2