def f(n):
    assert n >= 0
    answer = 1
    while n > 1:
        answer *= n
        n -= 1
    return answer

def fact(n):
    assert n >= 0
    if n <= 1:
        return n
    else:
        return n*fact(n - 1)

def g(n):
    x = 0
    for i in range(n):
        for j in range(n):
            x += 1
    return x

def h(x):
    assert type(x) == int and x >= 0
    answer = 0
    s = str(x)
    for c in s:
        answer += int(c)
    return answer


def search(L, e):
    for elem in L:
        if elem == e:
            return True
        if elem > e:
            return False
    return False

##L = range(100)
##print search(L, 0)
##print search(L, 50)
##print search(L, 100)

def bSearch(L, e, low, high):
    global numCalls
    numCalls += 1
    if high - low < 2:
        return L[low] == e or L[high] == e
    mid = low + int((high - low)/2)
    if L[mid] == e:
        return True
    if L[mid] > e:
        return bSearch(L, e, low, mid - 1)
    else:
        return bSearch(L, e, mid + 1, high)

def search(L, e):
    return bSearch(L, e, 0, len(L) - 1)

##L = range(100)
##numCalls = 0
##search(L, 100)
##msg = 'Number of calls when length = '
##print msg + str(len(L)) + ' is', numCalls
##L = range(200)
##numCalls = 0
##search(L, 200)
##print msg + str(len(L)) + ' is', numCalls
##L = range(400)
##numCalls = 0
##search(L, 400)
##print msg + str(len(L)) + ' is', numCalls
##L = range(800)
##numCalls = 0
##search(L, 800)
##print msg + str(len(L)) + ' is', numCalls
##L = range(1600)
##numCalls = 0
##search(L, 1600)
##print  msg + str(len(L)) + ' is', numCalls
##L = range(10000000) #ten million
##numCalls = 0
##search(L, 10000000)
##print msg + str(len(L)) + ' is', numCalls
##