# angka = int(input())

# heapTree = []

# def queue(Tree,nilai):
#     i = 0
#     leftChild = 2*(i) + 1
#     rightChild = 2*(i) + 2
#     if Tree[i] is None :
#         Tree.insert(i,nilai)
#     else:
#         if 2*(i-1) + 1 is None:
#             if nilai > Tree[leftChild//2]:
#                 Tree.insert(leftChild,nilai)
#                 i += 1
#             elif nilai < Tree[parent]:
#                 Tree.insert(i,)
#                 while Tree[parent] > Tree[i]:
#                     Tree[parent],Tree[i] = Tree[i],Tree[parent]
#                     i = parent
#                 i += 1 
#         else:
#             if nilai > Tree[//2]:
#                 Tree.insert(rightChild,nilai)
#                 i += 1
#             elif nilai < Tree[parent]:
#                 while Tree[parent] > Tree[i]:
#                     Tree[parent],Tree[i] = Tree[i],Tree[parent]
#                     i = parent
#                 i += 1 


