new

def insertionSort():
    for i in range(1,n):
        j=i-1
        key=A[i]
        while j>=0 and A[j]>key:
            A[j+1]=A[j]
            j=j-1
        A[j+1]=key
    return A

import numpy as np
A = []
n = int(input("Range:"))
for i in range(n):
    A.append(int(input('Value'+str(i+1)+':')))
np.array(A)
print(insertionSort())