def binary_search(arr,left,right,x):
if right >= left:
mid = left+(right-left)//2
if arr[mid] == x:
return mid
elif arr[mid]>x:
return binary_search(arr,left,mid-1,x)
else:
return binary_search(arr,mid+1,right,x)
array = [18,28,30,48,58,60,70,80]
x = 80
result = binary_search(array,8,len(array)-1,x)
print(result)
my_list = [12,3,4,5,5,6]
for x in my_list:
print(my_list[x])