#st = input()
#st = list(map(int, st.split(" ")))
st = [0, 4, 6, 3, 7, 1, 2, 5]
def mergeSort(A):
    if A == None or len(A) == 1:
        return A
    A1 = A[:int(len(A) / 2 + 0.5)]
    A2 = A[len(A1):]
    mergeSort(A1)
    mergeSort(A2)
    A = A1 + A2
    left = 0
    right = len(A) - 1
    mid = len(A1) - 1
    A = merge(A, left, mid, right)
    return A

def merge(A, left, mid, right):
    res = []
    i = left
    j = mid + 1
    while i <= mid and j <= right:
        if A[i] <= A[j]:
            res.append(A[i])
            i += 1
        else:
            res.append(A[j])
            j += 1
    if i > mid:
        res += A[j:]
    else:
        res += A[i : mid + 1]
    print(res)
    return res
mergeSort(st)