Binary Search Algorithm

import math

Numbers = []
for Number in range (1000):
    Numbers.append(Number)

Search = int(input("Number to Search:"))

lowNumber = 0
highNumber = len(Numbers)-1
Loop = True

while highNumber >= lowNumber and Loop is True:
    midNumber = math.ceil((lowNumber + highNumber) / 2)
    if Search > Numbers[midNumber]:
        Aux = Numbers[midNumber]
        Aux = Numbers.index(Aux)
        lowNumber = Aux+1
    elif Search < Numbers[midNumber]:
        Aux = Numbers[midNumber]
        Aux = Numbers.index(Aux)
        highNumber = Aux-1
    elif Search == Numbers[midNumber]:
        print("Done!")
        Loop = False