def merge_sort(S):
    if len(S) <= 1:
        return S
    mid = len(S) // 2
    left = merge_sort(S[:mid])
    right = merge_sort(S[mid:])
    return sorted(left + right)

# Main Program
while True:
    n = int(input("Enter number of elements (greater than zero): "))
    if n > 0:
        S = [int(input(f"Enter element {i+1}: ")) for i in range(n)]
        print("Elements before sorting:", S)
        S = merge_sort(S)
        print("Elements after sorting :", S)
    else:
        print("Invalid input!")

    c = int(input("Press 1 to continue, 0 to exit: "))
    if c != 1:
        print("Program Terminated")
        break