def noop(elm):
    return elm


def fib(elm):
    return elm if elm <= 1 else fib(elm - 1) + fib(elm - 2)


def search1(elm, lst, fct):
    for elm1 in lst:
        for elm2 in lst:
            if elm == fct(elm1 + elm2):
                return True
    return False


def search2(elm, lst, fct):
    length = len(lst)
    for i in range(length):
        for j in range(i, length):
            if elm == fct(lst[i] + lst[j]):
                return True
    return False