def swap_keys_values(d):
    return {v: k for k, v in list(d.items())}


Swap the keys of a dictionary with its values.


def swap_unique_keys_values(dictionary):
    oldkeys = []
    oldvalues = []
    swappeddict = {}
    for value in list(dictionary.values()):
        oldvalues.append(value)
    for key in list(dictionary.keys()):
        oldkeys.append(key)
    i = 0
    while i < len(oldkeys):
        swappeddict[oldvalues[i]] = oldkeys[i]
        i = i + 1
    for value in oldvalues:
        if oldvalues.count(value) == 2 and value in swappeddict:
            swappeddict.pop(value)
    return swappeddict

Swap the keys of a dictionary with its unique values.


def swap_keys_values(d):
    dictionary = {}
    for key in d:
        dictionary[d[key]] = key
    return dictionary


def swap_unique_keys_values(d):
    dic = {}
    values = []
    notunique = []
    for key in d:
        if d[key] in values:
            notunique.append(d[key])
        else:
            values.append(d[key])
    for key in d:
        if not d[key] in notunique:
            dic[d[key]] = key
    return dic


def swap_keys_values(d):
    swappedDict = {}
    for i in d:
        swappedDict[d[i]] = i
    return swappedDict


def swap_unique_keys_values(d):
    swappedDict = {}
    for i in d:
        if d[i] in swappedDict:
            del swappedDict[d[i]]
        else:
            swappedDict[d[i]] = i
    return swappedDict


def swap_keys_values(n):
    dic = {}
    for key in n:
        dic[n[key]] = key
    return dic


def swap_unique_keys_values(n):
    dic = {}
    values = []
    no_uni = []
    for key in n:
        if n[key] in values:
            no_uni.append(n[key])
        else:
            values, append(n[key])
    for key in n:
        if not n[key] in no_uni:
            dic[n[key]] = key
    return dic


def swap_unique_keys_values(n):
    dic = {}
    values = []
    no_uni = []
    for key in n:
        if n[key] in values:
            no_uni.append(n[key])
        else:
            values.append(n[key])
    for key in n:
        if not n[key] in no_uni:
            dic[n[key]] = key
    return dic


def swap_keys_values(dict_descriptor):
    new_dict = {}
    for key, values in list(dict_descriptor.items()):
        new_dict[values] = keys
    return new_dict


def swap_keys_values(dict_descriptor):
    new_dict = {}
    for keys, values in list(dict_descriptor.items()):
        new_dict[values] = keys
    return new_dict


def swap_unique_keys_values(d):
    d2 = {}
    d3 = {}
    ds = sorted(list(d.items()), reverse=True)
    for k, v in ds:
        if v not in d2:
            d2[v] = k
        else:
            d2[v] = 'N'
    ds2 = sorted(list(d2.items()), reverse=True)
    for k, v in ds2:
        if v != 'N':
            d3[k] = v
    return d3


def swap_keys_values(d):
    dict_ = sys.argv[1]
    new_dict = {}
    for k, v in list(dict_.items()):
        new_dict[v] = k


def swap_keys_values(d):
    new_dict = {}
    for k, v in list(d.items()):
        new_dict[v] = k


def swap_keys_values(dictionary):
    new_dict = {}
    for k, v in list(dictionary.items()):
        new_dict[v] = k


def swap_keys_values(dictionary):
    new_dict = {}
    for k, v in list(dictionary.items()):
        new_dict[v] = k
    return new_dict


def swap_unique_keys_values(dictionary):
    new_dict = {}
    for k, v in list(dictionary.items()):
        if v in new_dict:
            del new_dict[v]
        else:
            new_dict[v] = k
    return new_dict


def append2list(l1, l2=[]):
    newL = list(l2)
    for i in l1:
        newL.append(i)
    return newL

Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.


def append2list(l1, l2=[]):
    return l2 + l1


def swap_keys_values(d):
    return {v: k for k, v in list(d.items())}


def swap_unique_keys_values(d):
    new_dict = {}
    for k in d:
        v = d.get(k)
        if v in new_dict:
            del new_dict[v]
        else:
            new_dict[v] = k
    return new_dict


def swap_unique_keys_values(d):
    d2 = {}
    d3 = {}
    ds = sorted(list(d.items()), reverse=True)
    for k, v in ds:
        if v not in d2:
            d2[v] = k
        else:
            d2[v] = 'N'
    ds2 = sorted(list(d2.items()), reverse=True)
    for k_v in ds2:
        if v != 'N':
            d3[k] = v
    return d3


def swap_unique_keys_values(d):
    new = {}
    keys = [key for key in list(d.keys())]
    values = [value for value in list(d.values())]
    for v in list(d.values()):
        if values.count(v) == 1:
            new[v] = k
    return new


def swap_unique_keys_values(d):
    new = {}
    keys = [k for k in list(d.keys())]
    values = [v for v in list(d.values())]
    for k, v in list(d.items()):
        if values.count(v) == 1:
            new[v] = k
    return new


def swap_keys_values(d):
    final = {}
    for key in d:
        final[d[key]] = key
    return final


def swap_unique_keys_values(d):
    new_dict = {}
    for key in d:
        if d[key] not in new_dict:
            new_dict[d[key]] = key
    return new_dict


def swap_unique_keys_values():
    d = {}
    d2 = {}
    ds = sorted(list(d.items()), reverse=True)
    for k, v in ds:
        if v not in d:
            d[v] = k
        else:
            d[v] = 'N'
    ds2 = sorted(list(d.items()), reverse=True)
    for k, v in ds2:
        if v != 'N':
            d2[k] = v
    return d2


def swap_unique_keys_values(d):
    d = {}
    d2 = {}
    ds = sorted(list(d.items()), reverse=True)
    for k, v in ds:
        if v not in d:
            d[v] = k
        else:
            d[v] = 'N'
    ds2 = sorted(list(d.items()), reverse=True)
    for k, v in ds2:
        if v != 'N':
            d2[k] = v
    return d2


def swap_unique_keys_values(d):
    d1 = {}
    new_dict = {}
    for k, v in d:
        if d[v] not in d1:
            d1[v] = k
        else:
            d1[v] = ''
    for k, v in d1:
        if v != '':
            new_dict[k] = v
    return new_dict


def swap_keys_values(my_dic):
    swapped_dic = {}
    dic_items = sorted(my_dic.items())
    for i in dic_items:
        key, value = i[0], i[1]
        swapped_dic[value] = key
    return swapped_dic


def swap_unique_keys_values(my_dic):
    unique_dic = {}
    for k, v in list(my_dic.items()):
        if v in unique_dic:
            del unique_dic[v]
        else:
            unique_dic[v] = k
    return unique_dic


def swap_unique_keys_values(d):
    new_dict = {}
    for key in d:
        if d[key] not in new_dict:
            new_dict[d[key]] = key
        else:
            del new_dict[d[key]]
    return new_dict


def swap_keys_values():
    new_dic = {}
    for key in dic:
        if dic[key] not in new_dic:
            new_dic[dic[key]] = key
    return new_dic


def swap_unique_keys_values(d):
    nd = {}
    for key in d:
        if d[key] not in nd:
            nd[d[key]] = key
        else:
            del nd[d[key]]
    return nd


def swap_keys_values(d):
    return {v: k for k, v in list(dic.items())}


def swap_keys_values(dic):
    return {v: k for k, v in list(dic.items())}


def swap_unique_keys_values():
    new_dic = {}
    for key in dic:
        if dic[key] not in new_dic:
            new_dic[dic[key]] = key
        else:
            del new_dic[d[key]]
    return new_dic


def swap_unique_keys_values(dic):
    new_dic = {}
    for key in dic:
        if dic[key] not in new_dic:
            new_dic[dic[key]] = key
        else:
            del new_dic[dic[key]]
    return new_dic


def swap_keys_values(d):
    return {v: k for k, v in list(d.items())}


def swap_keys_values(d):
    new_d = {}
    for k, v in list(d.items()):
        new_d[v] = k
    return new_d


def swap_unique_keys_values(d):
    new_d = {}
    for k, v in list(d.items()):
        if v not in new_d:
            new_d[v] = k
        else:
            del new_d[v]
    return new_d


Test if two circles overlap.


def append2list(l1, l2=None):
    if l2 == None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    distance = hypot(x2 - x1, y2 - y1)
    return distance < r1 + r2

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    distance = math.sqrt(x2 - x1 ** 2 + (y2 - y1) ** 2)
    return r1 - r2 < distance < r1 + r2

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    return distance <= r1 + r2

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    return distance < r1 + r2 or distance == r1 + r2

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    return distance < r1 + r2

Test if two circles overlap.


def append2list(l1, l2=[]):
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=[]):
    for i in l1:
        l2.append(l1[i])
    return l2


def append2list(l1, l2=None):
    if l2 is None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    d = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    if d <= r1 + r2:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    d = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    if d >= r1 + r2:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    d = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    if d < r1 + r2:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    if math.sqrt((x2 - x1) ** 2 + (y2 + y1) ** 2) < r1 + r2:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    if math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) < r1 + r2:
        return True
    else:
        return False

Test if two circles overlap.


def append2list(l1, l2=None):
    for i in l1:
        l2.append(i)
    return l2


_A = None

def overlap(x1=_A, y1=_A, r1=_A, x2=_A, y2=_A, r2=_A):
    if x1 is _A:
        x1 = 0
    if y1 is _A:
        y1 = 0
    if r1 is _A:
        r1 = 1
    if x2 is _A:
        x2 = 0
    if y2 is _A:
        y2 = 0
    if r2 is _A:
        r2 = 1
    if ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 > float(r2) + float(r1):
        return False
    else:
        return True

Test if two circles overlap.


_A = None

def overlap(x1=_A, y1=_A, r1=_A, x2=_A, y2=_A, r2=_A):
    if x1 is _A:
        x1 = 0
    if y1 is _A:
        y1 = 0
    if r1 is _A:
        r1 = 1
    if x2 is _A:
        x2 = 0
    if y2 is _A:
        y2 = 0
    if r2 is _A:
        r2 = 1
    if ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 >= float(r2) + float(r1):
        return False
    else:
        return True

Test if two circles overlap.


Test if two circles overlap.


def append2list(l1):
    l2 = []
    for i in l1:
        l2.append(i)
    return l2


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    if (x2 - x1) ** 2 + (y2 - y1) ** 2 < r1 + r2:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    if math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2) <= r1 + r2:
        return True
    else:
        return False

Test if two circles overlap.


def append2list(l1, l2=[]):
    for i in l1:
        l2 = l2 + [i]
    return l2


def append2list(l1, l2=''):
    if l2 == '':
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    dif = r1 - r2
    summ = r1 + r2
    if dif <= distance and summ >= distance:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    distance = (x2 - x1) ** 2 + (y2 - y1) ** 2
    dif = r1 - r2
    summ = r1 + r2
    if dif ** 2 <= distance and summ ** 2 >= distance:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    distance = (x2 - x1) ** 2 + (y2 - y1) ** 2
    summ = r1 + r2
    if summ ** 2 > distance:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1, y1, r1, x2, y2, r2):
    dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5
    if r1 + r2 >= dist:
        return False
    else:
        return True

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5
    if r1 + r2 > dist:
        return True
    else:
        return False

Test if two circles overlap.


def append2list(l1, l2=None):
    if l2 == None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=[]):
    for i in l2:
        l1.append(i)
    return l1


def append2list(l1, l2=[]):
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=None):
    if l2 is None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    radsum = (r1 + r2) ** 2
    if dist < radsum:
        return True
    return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    radsum = (r1 + r2) ** 2
    raddif = (r1 - r2) ** 2
    if dist < radsum and dist > raddif:
        return True
    return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    radsum = (r1 + r2) ** 2
    raddif = math.sqrt((r1 - r2) ** 2)
    if dist < radsum and dist > raddif:
        return True
    return False

Test if two circles overlap.


Test if two circles overlap.


def overlap(x1, y1, r1, x2, y2, r2):
    if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2:
        return True
    else:
        return False

Test if two circles overlap.


def index(str, letter):
    i = 0
    while i < len(str):
        if letter == str[i]:
            return i
        i = i + 1
    return -1

Iteratively search for the position of letter in str, return -1 if it is not there.


def fibonacci(n):
    if n == 0:
        return 0
    if n == 1:
        return 1
    else:
        fibN_2 = 0
        fibN_1 = 1
        i = 2
        while i <= n:
            fibN = fibN_2 + fibN_1
            fibN_2 = fibN_1
            fibN_1 = fibN
            i = i + 1
        return fibN

Iteratively compute the value of the fibonacci series at position n.


def search(str, letter):
    i = 0
    while i < len(str):
        if letter == str[i]:
            return True
        i = i + 1
    return False

assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True

Iteratively search for a letter in a string


def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)

assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657

Recursively compute the value of the fibonacci series at position n.


def search(str, letter):
    if str == '':
        return False
    elif str[0] == letter:
        return True
    else:
        return search(str[1:], letter)

Recursively search for a letter in a string


def index(str, letter, pos):
    if pos == len(str):
        return -1
    elif str[pos] == letter:
        return pos
    else:
        return index(str, letter, pos + 1)

Recursively search for the position of letter in str, return -1 if it is not there.


def distance(x1, y1, x2, y2):
    return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)

def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=0):
    distance = distance(x1, y1, x2, y2)
    return distance < r1 + r2

Test if two circles overlap.


def distance(x1, y1, x2, y2):
    return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)

def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=0):
    dist = distance(x1, y1, x2, y2)
    return distance < r1 + r2

Test if two circles overlap.


def distance(x1, y1, x2, y2):
    return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)

def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=0):
    dist = distance(x1, y1, x2, y2)
    return dist < r1 + r2

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    x = abs(x1 - x2)
    y = abs(y1 - y2)
    distance = x ** 2 + y ** 2
    if distance ** (1 / 2) >= r1 + r2:
        return False
    else:
        return True

Test if two circles overlap.


def distance(x1, y1, x2, y2):
    return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)

def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    dist = distance(x1, y1, x2, y2)
    return dist < r1 + r2

Test if two circles overlap.


def append2list(l1, l2=[]):
    for i in l1:
        l2.append(i)
    return l2


def search(str, letter):
    if letter in str:
        print('True')
    else:
        print('False')


def index(str, letter):
    if letter not in str:
        print(-1)
    else:
        i = 0
        while str[i] != letter:
            i = i + 1
        print(i)


def fibonacci(n):
    print(n - 1 + n - 2)


def fibonacci(n):
    print(n - 1 + (n - 2))


def fibonacci(n):
    print(n[n - 1] + n[n - 2])


def search(string, letter):
    i = 0
    a = []
    while i < len(string):
        a.append(string[i])
        i = i + 1
    if letter not in a:
        return 'False'
    else:
        return 'True'


def search(string, letter):
    return letter in string


def search(string, letter):
    if letter in string:
        print('True')
    else:
        print('False')


def search(str, letter):
    if letter in str:
        return True
    else:
        return False


def search(string, letter):
    if letter in string:
        return 'True'
    else:
        return 'False'


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    if i == len(str) - 1:
        return -1


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    if i == len(str) - 1:
        return '-1'


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    print(len(str))


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    print(len(str))
    print(i)


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    if i == len(str):
        return '-1'


def search(str, letter):
    for letters in str:
        if letters in str:
            print('True')
        else:
            print('False')


def index(str, letter):
    if letter in str:
        print(letter[0])
    else:
        print(letter[-1])


def search(str, letter):
    for letters in str:
        if letter in str:
            print('True')
        else:
            print('False')


def index(str, letter):
    if letter in str:
        print(str[0])
    else:
        print(str[-1])


def index(str, letter):
    if letter in str:
        return str[0]
    else:
        return str[-1]


def append2list(l1, l2=[]):
    for i in l1:
        l2.append(i)
    return l2


def search(str, letter):
    if letter in str:
        return 'True'
    else:
        return 'False'


def index(str, letter):
    if letter in str:
        return pos(letter)
    else:
        return '-1'


def fibonacci(n):
    list = [0, 1]
    i = 0
    while n >= len(list):
        new_num = list[i] + list[i + 1]
        list.append(new_num)
        i = i + 1
    print(list[-1])


def search(str, letter):
    if letter in str:
        print('True')
    else:
        print('False')


def fibonacci(n):
    list = []
    i = 0
    while n >= len(list):
        new_num = list[i] + list[i + 1]
        list.append(new_num)
        i = i + 1
    print(list[-1])


def search(str, letter):
    if letter in str:
        return True
    else:
        return False


def fibonacci(n):
    list = []
    i = 0
    while n >= len(list):
        if len(list) > 1:
            new_num = list[i] + list[i + 1]
        else:
            new_num = list[i] + 1
        list.append(new_num)
        i = i + 1
    print(list[-1])


def search(string, letter):
    i = 0
    a = []
    while i < len(string):
        a.append(string[i])
        i = i + 1
    if letter not in a:
        return 'False'
    else:
        return 'True'


def index(string, letter):
    i = 0
    a = []
    while i < len(string):
        a.append(string[i])
        if string[i] == letter:
            return i
        i = i + 1
    if letter not in a:
        return '-1'


def index(str, letter):
    if letter in str:
        i = 0
        while i < len(str):
            if letter == str[i]:
                print(i)
            i = i + 1
    else:
        return '-1'


def index(str, letter):
    if letter in str:
        i = 0
        while i < len(str):
            if letter == str[i]:
                return i
            i = i + 1
    else:
        return '-1'


def search(str, letter):
    B = False
    A = True
    for letters in str:
        statement = A
        while statement != A:
            if letter in letters:
                print(A)
                statement = B
            else:
                print(B)


def index(str, letter):
    if letter in str:
        i = 0
        while i < len(string):
            if letter == str[i]:
                return i
            i = i + 1
    else:
        return '-1'


def search(str, letter):
    if letter in str:
        print(True)
    else:
        print(False)


def append2list(l1, l2=None):
    if l2 == None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def search(string, letter):
    if letter in string:
        return 'True'
    else:
        return 'False'


def index(string, letter):
    if letter in string:
        i = 0
        while i < len(string):
            if letter == string[i]:
                print(i)
            i = i + 1
    else:
        return '-1'


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    if i == len(str):
        return '-1'


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            new_num = list[i] + list[i - 1]
        else:
            new_num = list[i] + 1
        list.append(new_num)
        i = i + 1
    print(list[-1])


def index(string, letter):
    if letter in string:
        i = 0
        while i < len(string):
            if letter == string[i]:
                return i
            i = i + 1
    else:
        return '-1'


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            new_num = list[i] + list[i - 1]
        else:
            new_num = list[i] + 1
        list.append(new_num)
        i = i + 1
    return list[-1]


def index(string, letter):
    position = -1
    i = 0
    while i < len(string):
        if string[i] == letter:
            position = i
        i = i + 1
    print(position)


def search(string, letter):
    print(letter in string)


def search(letter):
    str = input()
    letter = input()
    if letter in str:
        print(True)
    else:
        print(false)


def search(str, letter):
    if letter in str:
        print('True')
    else:
        print('False')


def search(str, letter):
    if letter in str:
        return True
    else:
        return False


def index(str, letter, num):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    if i == len(str):
        return '-1'


def search(str, letter):
    for letter in str:
        return True


def search(letter):
    str = input()
    if letter in str:
        print(True)
    else:
        print(false)


def search(str, letter):
    if letter in str:
        return 'True'
    else:
        return 'False'


def search(string, letter):
    return letter in string


def index(string, letter):
    position = -1
    i = 0
    while i < len(string):
        if string[i] == letter:
            position = i
        i = i + 1
    return position


def search(letter):
    str = input()
    if letter in str:
        return True
    else:
        return false


def index(str, letter):
    if letter in str:
        i = 0
        while i < len(str):
            if letter == str[i]:
                return i
            i = i + 1
    else:
        return '-1'


def index(str, letter):
    if letter not in str:
        return -1


def index(str, letter):
    if letter in str:
        return str.find(letter)
    else:
        return '-1'


def search(string, letter):
    if letter not in string:
        return 'False'
    else:
        return 'True'


def index(string, letter):
    i = 0
    a = []
    while i < len(string):
        a.append(string[i])
        if string[i] == letter:
            return i
        i = i + 1
    if letter not in a:
        return '-1'


def index(str, letter):
    if letter not in str:
        return -1
    else:
        return str[letter]


def fibonacci(n):
    n = n - 1 + n - 2
    print(n)


def index(str, letter):
    if letter in str:
        i = 0
        while i < len(str):
            if letter == str[i]:
                print(i)
            i = i + 1
    else:
        print('-1')


def index(str, letter):
    if letter not in str:
        return -1
    else:
        return str


def search(str, letter):
    if letter in str:
        return True
    else:
        return False


def index(str, letter):
    if letter not in str:
        return -1
    else:
        return letter


def index(str, letter):
    if letter not in str:
        return -1
    else:
        return letter.index()


def fibonacci(n):
    a, b = 1, 1
    for i in range(n - 1):
        a, b = b, a + b
    return a


def index(s, l):
    i, first = 0, -1
    while i < len(s):
        if s[i] == l:
            first = i
            break
        i += 1
    return first


def search(s, l):
    contains = False
    for c in s:
        if c == l:
            contains = True
    return contains


def fibonacci(n):
    total = 0
    n0 = 0
    n1 = 1
    if n == 0:
        total = n0
        print(total)
    elif n == 1:
        total = n1
        print(total)
    else:
        while total < n:
            n = n0 + n1
            n0 = n1
            n1 = n
            total = total + 1
        print(total)


def search(string, letter):
    return letter in string


def index(string, letter):
    position = -1
    i = 0
    while i < len(string):
        if string[i] == letter:
            position = i
        i = i + 1
    return position


def index(str, letter):
    i = 0
    while i < len(str):
        if letter in str[i]:
            return i
        else:
            return '-1'
        i = i + 1


def search(str, letter):
    if letter in str:
        return 'True'
    else:
        return 'False'


def fibonacci(n):
    total = 0
    n0 = 0
    n1 = 1
    if n == 0:
        total = n0
        print(total)
    elif n == 1:
        total = n1
        print(total)
    else:
        while total < n:
            n = n0 + n1
            n0 = n1
            n1 = n
            total = total + 1
        return total


def index(str, letter):
    if letter not in str:
        return -1
    else:
        return ord(letter)


def fibonacci(n):
    total = 0
    n0 = 0
    n1 = 1
    if n == 0:
        total = n0
        return total
    elif n == 1:
        total = n1
        return total
    else:
        while total < n:
            n = n0 + n1
            n0 = n1
            n1 = n
            total = total + 1
        return total


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    if i == len(str):
        return '-1'


def index(str, letter):
    if letter not in str:
        return -1
    else:
        return ord(letter) - 100


def fibonacci(n):
    if n == 0:
        a = 1
    else:
        a, b = 1, 1
        for i in range(n - 1):
            a, b = b, a + b
    return a


def index(str, letter):
    if letter not in str:
        return -1
    else:
        return rdict[letter]


def search(str, letter):
    if letter in str:
        return True
    else:
        return False


def index(str, letter):
    i = 0
    while i < len(str):
        position = 0
        if letter in str:
            position += 1
            return position
        else:
            return '-1'


def index(str, letter):
    if letter in str:
        i = 0
        while i < len(str):
            if letter == str[i]:
                return i
            i = i + 1
    else:
        return '-1'


def index(s, l):
    i, first = 0, -1
    while i < len(s):
        if s[i] == l:
            first = i
            break
        i += 1
    return first


def search(s, l):
    contains = False
    for c in s:
        if c == l:
            contains = True
    return contains


def fibonacci(n):
    if n == 0:
        a = 0
    else:
        a, b = 1, 1
        for i in range(n - 1):
            a, b = b, a + b
    return a


def fibonacci(n):
    i = 0
    while i < 10:
        if n in fibonacci:
            print(n[i])
        i = i + 1


def index(str, letter):
    i = 0
    while i < len(str):
        if letter in int(str[i]):
            return i
        else:
            return '-1'
        i = i + 1


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            new_num + list[i] + list[i - 1]


def index(str, letter):
    i = 0
    while i < len(str):
        if letter in str[i]:
            return i
            i = i + 1
        else:
            return '-1'


def search(str, letter):
    if letter in str:
        return 'True'
    else:
        return 'False'


def fibonacci(n):
    i = 0
    fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
    while i < 10:
        if n in fib:
            return fib[i]
        i = i + 1


def index(str, letter):
    i = 0
    while i < len(str):
        if letter in str[i]:
            return i
        else:
            return '-1'
        i = i + 1


def fibonacci(n):
    i = 0
    fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
    while i < 10:
        if n in fib:
            return fib[i]
            i = i + 1
        else:
            i = i + 1


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    if i == len(str):
        return '-1'


def index(str, letter):
    i = 0
    while i < len(str):
        if letter in str[i]:
            return str[i]
        else:
            return '-1'
        i = i + 1


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            new_num + list[i] + list[i - 1]
        else:
            new_num = list[i] + 1
        list.append(new_num)
        i = i + 1
    return list[-1]


def index(str, letter):
    i = 0
    while i < len(str):
        if letter in str[i]:
            return str[i]
        i = i + 1
    else:
        return '-1'
    i = i + 1


def index(str, letter):
    if letter not in str:
        return -1
    else:
        return str.find(letter)


def search(str, letter):
    if letter in str:
        return True
    else:
        return False


def index(str, letter):
    i = 0
    while i < len(str):
        if letter in str[i]:
            return i
        i = i + 1
    else:
        return '-1'
    i = i + 1


def index(str, letter):
    i = 0
    while i < len(str):
        if letter in str[i]:
            return i
        i = i + 1
    else:
        return '-1'


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            new_num + list[i] + list[i - 1]
        else:
            new_num = list[i] + 1
        list.append(new_num)
        i = i - 1
    return list[-1]


def fibonacci(n):
    if n < 2:
        return n
    return fib(n - 2) + fib(n - 1)


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            new_num + list[i] + list[i - 1]
        else:
            new_num = list[i] + 1
        list.append(new_num)
        i = i + 1
    return list[+1]


def fibonacci(n):
    if n < 2:
        return n
    return fibonacci(n - 2) + fibonacci(n - 1)


def index(string, letter):
    if letter in string:
        i = 0
        while i < len(string):
            if letter == string[i]:
                return i
            i = i + 1
    else:
        return '-1'


def search(string, letter):
    i = 0
    while i < len(string):
        if string[i] == letter:
            return True
        i = i + 1
    return False


def search(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return True
        i = i + 1
    return False


def search(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return True
        i = i + 1
    return False


def search(str, letter):
    if letter in str:
        return 'True'
    else:
        return 'False'


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    if i == len(str):
        return '-1'


def index(string, letter):
    i = 0
    a = []
    while i < len(string):
        a.append(string[i])
        if string[i] == letter:
            return i
        i = i + 1
    if letter not in a:
        return '-1'


def search(string, letter):
    if letter not in string:
        return 'False'
    else:
        return 'True'


def fibonacci(n):
    i = 0
    j = 1
    k = 1
    while i < len(i):
        j = k
        k = k + j
        if n in k:
            return i
        i = i + 1


def fibonacci(n):
    i = 0
    j = 1
    k = 1
    while i < n:
        j = k
        k = k + j
        if n in k:
            return i
        i = i + 1


def index(str, letter):
    i = 0
    while i < len(str):
        position = 0
        if letter in str:
            position = position + 1
            return position
        else:
            return str + '-1'


def index(str, letter):
    i = 0
    while i < len(str):
        position = 0
        if letter in str:
            position = position + 1
            return position
        else:
            return '-1'


def index(str, letter):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return i
        i = i + 1
    return '-1'


def index(str, letter):
    i = 0
    while i < len(str):
        if letter in str[i]:
            return i
        i = i + 1
    else:
        return '-1'


def fibonacci(n):
    i = 0
    j = 1
    k = 1
    while i < n:
        j = k
        k = k + j
        if int(n) in k:
            return i
        i = i + 1


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        i = i + 1
    return '-1'


def fibonacci(n):
    i = 0
    j = 1
    k = 1
    while i < n:
        j = k
        k = k + j
        return k
        i = i + 1


def fibonacci(n):
    i = -1
    j = 1
    k = 1
    while i < n:
        j = k
        k = k + j
        return k
        i = i + 1


def fibonacci(n):
    i = -1
    j = 1
    k = 1
    while i < n:
        j = k
        k = k + j
        i = i + 1
    return k


def search(str, letter):
    if letter in str:
        return True
    else:
        return False


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            new_num = list[i] + list[i - 1]
        else:
            new_num = list[i] + 1
        list.append(new_num)
        i = i - 1
    return list[-1]


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            new_num = list[i] + list[i - 1]
        else:
            new_num = list[i] + 1
        list.append(new_num)
        i = i + 1
    return list[-1]


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    if i == len(str):
        return '-1'


def search(str, letter):
    if letter in str:
        return 'True'
    else:
        return 'False'


def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    elif n > 1:
        x = 0
        y = 1
        z = 2
        for i in range(3, n):
            x = y + z
            y = z
            z = x
        return x
    else:
        retrun - 1


def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    elif n > 1:
        x = 0
        y = 1
        z = 2
        for n in range(3, n):
            x = y + z
            y = z
            z = x
        return x
    else:
        retrun - 1


def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        return F(n - 1) + F(n - 2)


def search(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return True
        i = i + 1
    return False


def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)


def index(str, letter):
    if letter in str:
        return str.find(letter)
    else:
        return '-1'


def search(string, letter):
    if letter not in string:
        return 'False'
    else:
        return 'True'


def index(string, letter):
    i = 0
    a = []
    while i < len(string):
        a.append(string[i])
        if string[i] == letter:
            return i
        i = i + 1
    if letter not in a:
        return '-1'


def index(str, letter):
    if letter in str:
        i = 0
        while i < len(str):
            if letter == str[i]:
                return i
            i = i + 1
    else:
        return '-1'


def index(string, letter):
    position = -1
    i = 0
    while i < len(string):
        if string[i] == letter:
            position = i
        i = i + 1
    return position


def fibonacci(n):
    total = 0
    n0 = 0
    n1 = 1
    if n == 0:
        total = n0
        return total
    elif n == 1:
        total = n1
        return total
    else:
        while total < n:
            n = n0 + n1
            n0 = n1
            n1 = n
            total = total + 1
        return total


def search(string, letter):
    return letter in string


def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    elif n > 1:
        return fibonacci(n - 1) + fibonacci(n - 2)
    else:
        return -1


def search(string, letter):
    i = 0
    while i < len(string):
        if string[i] == letter:
            return True
        i = i + 1
    return False


def index(string, letter):
    if letter in string:
        i = 0
        while i < len(string):
            if letter == string[i]:
                return i
            i = i + 1
    else:
        return '-1'


def fibonacci(n):
    a, b = 1, 1
    for i in range(n - 1):
        a, b = b, a + b
    return a


def index(str, letter):
    if letter not in str:
        print(-1)
    else:
        i = 0
        while str[i] != letter:
            i = i + 1
        print(i)


def search(str, letter):
    if letter in str:
        print('True')
    else:
        print('False')


def fibonacci(n):
    a, b = 1, 1
    for i in range(n - 1):
        a, b = b, a + b
    return a
    print(fib(5))


def search(str, letter):
    if letter in str:
        return 'True'
    else:
        return 'False'


def fibonacci(n):
    a, b = 0, 1
    for i in range(n - 1):
        a, b = b, a + b
    return a


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            new = list[i] + list[i - 1]
        else:
            new = list[i] + 1
        list.append(new)
        i = i + 1
    return list[-1]


def fibonacci(n):
    a = 0
    b = 1
    for i in range(0, n):
        temp = a
        a = b
        b = temp + b
    return a


def fibonacci(n):
    list = [0]
    i = 0
    while i < len(list):
        if line(str) > 1:
            nums = list[i] + list[i - 1]
        else:
            nums = list[1] - 1
        list.append(nums)
        i - 1 - i
    return list[-1]


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    if i == len(str):
        return '-1'


def search(str, letter):
    if letter in str:
        return True
    else:
        return False


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            new_num = list[i] + list[i - 1]
        else:
            new_num = list[i] + 1
        list.append(new_num)
        i = i + 1
    return list[-1]


def fibonacci(n):
    list = [0]
    i = 0
    while i < len(list):
        if list(str) > 1:
            nums = list[i] + list[i - 1]
        else:
            nums = list[1] - 1
        list.append(nums)
        i - 1 - i
    return list[-1]


def index(str, letter, num):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    if i == len(str):
        return '-1'


def fibonacci(n):
    list = [0]
    i = 0
    while i < len(list):
        if list(str) > 1:
            nums = list[i] + list[i - 1]
        else:
            nums = list[1] - 1
        list.append(nums)
        i = 1 - i
    return list[-1]


def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)


def search(ls, val):
    if ls == []:
        return -1
    elif ls[0] == val:
        return val
    else:
        return search(ls[1:], val)


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if list(str) > 1:
            nums = list[i] + list[i - 1]
        else:
            nums = list[1] - 1
        list.append(nums)
        i = 1 - i
    return list[-1]


def search(str, letter):
    if letter in str:
        print(True)
    else:
        print(False)


def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    elif n > 1:
        return fibonacci(n - 1) + fibonacci(n - 2)
    else:
        return -1


def search(word, letter):
    if letter in word:
        print('True')
    else:
        print('False')


def countdown(num=3):
    while num != 0:
        print(num)
        num = num - 1
    print('LIFT OFF!')

def search(word, letter):
    if letter in word:
        print('True')
    else:
        print('False')

def index(word, letter):
    if letter not in word:
        print(-1)
    else:
        i = 0
        while word[i] != letter:
            i = i + 1
        print(i)

def fibonacci(n):
    a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
    if n <= 1:
        print(a[n])
    elif n > 1:
        print(a[n - 1] + a[n - 2])


def index(word, letter):
    if letter not in word:
        print(-1)
    else:
        i = 0
        while word[i] != letter:
            i = i + 1
        print(i)


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            nums = list[i] + list[i - 1]
        else:
            nums = list[1] - 1
        list.append(nums)
        i = 1 - i
    return list[-1]


def fibonacci(n):
    if n < 2:
        return n
    return fibonacci(n - 2) + fibonacci(n - 1)


def search(str, letter):
    for letter in str:
        if letter in str:
            return True
        else:
            return False


def index(str, letter):
    if letter not in str:
        return -1
    else:
        return str.find(letter)


def search(str, letter):
    if letter in str:
        print(True)
    if letter not in str:
        print(False)


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    if i == len(str):
        return '-1'


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            nums = list[i] + list[i - 1]
        else:
            nums = list[i] + 1
        list.append(nums)
        i = 1 - i
    return list[-1]


def search(str, letter):
    if letter in str:
        return True
    else:
        return False


def search(str, letter):
    if letter in str:
        return 'True'
    else:
        return 'False'


def index(str, letter):
    if letter in str[i]:
        return i
    else:
        return '-1'


def fibonacci(n):
    total = 0
    n0 = 0
    n1 = 1
    if n == 0:
        total = n0
        return total
    elif n == 1:
        total = n1
        return total
    else:
        while total < n:
            n = n0 + n1
            n0 = n1
            n1 = n
            total = total + 1
        return total


def index(string, letter):
    position = -1
    i = 0
    while i < len(string):
        if string[i] == letter:
            position = i
        i = i + 1
    return position


def search(string, letter):
    return letter in string


def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    elif n > 1:
        return fibonacci(n - 1) + fibonacci(n - 2)
    else:
        return -1


def search(str, letter):
    i = 0
    while i < len(str):
        if letter in str:
            return True
        else:
            return False
        i += 1


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            n2 = list[i] + list[i - 1]
        else:
            n2 = list[i] + 1
        list.append(new_num)
        i = i + 1
    return list[-1]


def index(str, letter):
    if letter in str:
        i = 0
        while i < len(str):
            if letter == str[i]:
                return i
            i = i + 1
    else:
        return '-1'


def search(str, letter):
    i = 0
    while i < len(str):
        if letter in str:
            return True
        else:
            return False
        i = i + 1


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            n2 = list[i] + list[i - 1]
        else:
            n2 = list[i] + 1
        list.append(n2)
        i = i + 1
    return list[-1]


def search(str, letter):
    if letter in str:
        return true
    else:
        return false


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            new_num = list[i] + list[i - 1]
        else:
            new_num = list[i] + 1
        list.append(new_num)
        i = 1 - i
    return list[-1]


def countdown(num=3):
    while num != 0:
        print(num)
        num = num - 1
    print('LIFT OFF!')

def search(word, letter):
    if letter in word:
        return True
    else:
        return False

def index(word, letter):
    if letter not in word:
        print(-1)
    else:
        i = 0
        while word[i] != letter:
            i = i + 1
        print(i)

def fibonacci(n):
    a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
    if n <= 1:
        print(a[n])
    elif n > 1:
        print(a[n - 1] + a[n - 2])


def search(word, letter):
    if letter in word:
        return True
    else:
        return False


def index(word, letter):
    if letter not in word:
        print(-1)
    else:
        i = 0
        while word[i] != letter:
            i = i + 1
        print(i)


def search(str, letter):
    if letter in str:
        return True
    else:
        return False


def countdown(num=3):
    while num != 0:
        print(num)
        num = num - 1
    print('LIFT OFF!')

def search(word, letter):
    if letter in word:
        return True
    else:
        return False

def index(word, letter):
    if letter not in word:
        return -1
    else:
        i = 0
        while word[i] != letter:
            i = i + 1
        return i

def fibonacci(n):
    a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
    if n <= 1:
        return a[n]
    elif n > 1:
        return a[n - 1] + a[n - 2]


def index(word, letter):
    if letter not in word:
        return -1
    else:
        i = 0
        while word[i] != letter:
            i = i + 1
        return i


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            new_num = list[i] + list[i - 1]
        else:
            new_num = list[i] + 1
            list.append(new_num)
        i = 1 - i
    return list[-1]


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    if i == len(str):
        return '-1'


def index(string, letter):
    position = -1
    i = 0
    while i < len(string):
        if string[i] == letter:
            position = i
        i = i + 1
    return position


def fibonacci(n):
    total = 0
    n0 = 0
    n1 = 1
    if n == 0:
        total = n0
        return total
    elif n == 1:
        total = n1
        return total
    else:
        while total < n:
            n = n0 + n1
            n0 = n1
            n1 = n
            total = total + 1
        return total


def search(string, letter):
    if letter == string:
        return 'True'
    else:
        search(string[1:], letter)
    return 'False'


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            new_num = list[i] + list[i - 1]
        else:
            new_num = list[i] + 1
        list.append(new_num)
        i = 1 + i
    return list[-1]


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            new_num = list[i] + list[i - 1]
        else:
            new_num = list[i] + 1
        list.append(new_num)
        i = i + 1
    return list[-1]


def countdown(num=3):
    while num != 0:
        print(num)
        num = num - 1
    print('LIFT OFF!')

def search(word, letter):
    if letter in word:
        return True
    else:
        return False

def index(word, letter):
    if letter not in word:
        return -1
    else:
        i = 0
        while word[i] != letter:
            i = i + 1
        return i

def fibonacci(n):
    return n - 1 + n - 2


def index(str, letter, num):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    if i == len(str):
        return '-1'


def search(str, letter):
    i = 0
    if len(str) == 0:
        return False
    elif str[0] == letter:
        return True
    else:
        search(str[1:], letter)


def search(str, letter):
    i = 0
    if len(str) == 0:
        return False
    elif str[0] == letter:
        return True
    else:
        return search(str[1:], letter)


def index(str, letter, num):
    while num > 0:
        i = 0
        while i < len(str):
            if str[i] == letter:
                return i
            else:
                i = i + 1
        if i == len(str):
            return '-1'
    if num > 0:
        num = num - 1


def index(str, letter):
    if letter in str:
        return letter[i]
    else:
        return -1


def index(str, letter):
    if letter in str:
        return str[letter]
    else:
        return -1


def search(str, letter):
    if letter in str:
        return True
    else:
        return False


def index(str, letter):
    if letter in str:
        return str[int(letter)]
    else:
        return -1


def index(str, letter):
    if letter in str:
        return int(letter[i])
    else:
        return -1


def index(str, letter):
    if letter in str:
        return len(str[letter])
    else:
        return -1


def index(word, letter):
    if letter not in word:
        return -1
    else:
        i = 0
        while word[i] != letter:
            i = i + 1
        return i


def countdown(num=3):
    while num != 0:
        print(num)
        num = num - 1
    print('LIFT OFF!')

def search(word, letter):
    if letter in word:
        return True
    else:
        return False

def index(word, letter):
    if letter not in word:
        return -1
    else:
        i = 0
        while word[i] != letter:
            i = i + 1
        return i

def fibonacci(n):
    import math
    Phi = 1.61803398875
    return int((Phi ** n - (1 - Phi) ** n) / sqrt(5))


def search(word, letter):
    if letter in word:
        return True
    else:
        return False


def search(str, letter):
    i = 0
    while i < len(str):
        if letter in str:
            return True
        else:
            return False
        i = i + 1


def countdown(num=3):
    while num != 0:
        print(num)
        num = num - 1
    print('LIFT OFF!')

def search(word, letter):
    if letter in word:
        return True
    else:
        return False

def index(word, letter):
    if letter not in word:
        return -1
    else:
        i = 0
        while word[i] != letter:
            i = i + 1
        return i

def fibonacci(n):
    import math
    Phi = 1.61803398875
    return int((Phi ** n - (1 - Phi) ** n) / math.sqrt(5))


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            n2 = list[i] + list[i - 1]
        else:
            n2 = list[i] + 1
        list.append(n2)
        i = i + 1
    return list[-1]


def index(str, letter):
    if letter in str:
        i = 0
        while i < len(str):
            if letter == str[i]:
                return i
            i = i + 1
    else:
        return '-1'


def search(str, letter):
    if letter in str:
        return 'True'
    else:
        return 'False'


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    if i == len(str):
        return '-1'


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            new_num = list[i] + list[i - 1]
        else:
            new_num = list[i] + 1
        list.append(new_num)
        i = i + 1
    return list[-1]


def search(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return True
        i = i + 1
    return False


def index(str, letter):
    if letter in str:
        return str.find(letter)
    else:
        return -1


def index(str, letter, num):
    n = 0
    if letter in str:
        i = 0
        while i < len(str):
            if letter == str[i]:
                return i
            i = i + 1
    else:
        return '-1'


def search(str, letter):
    if letter in str:
        return True
    else:
        return False


def index(str, letter):
    i = 0
    while i < len(str) and str[i] != letter:
        i = i + 1
    if i < len(str):
        print(i + 1)
    else:
        print('-1')


def index(str, letter):
    if letter in str:
        return str.find(letter)
    else:
        return '-1'


def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)


def index(str, letter):
    i = 0
    while i < len(str) and str[i] != letter:
        i = i + 1
    if i < len(str):
        print(i)
    else:
        print('-1')


def search(string, letter):
    if string == []:
        return False
    elif string[0] == letter:
        return True
    else:
        return search(string[1:], letter)


def index(str, letter):
    i = 0
    while i < len(str) and str[i] != letter:
        i = i + 1
    if i < len(str):
        return i
    else:
        return '-1'


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        i = i + 1
    return '-1'


def fibonacci(n):
    Fval = 0
    Sval = 1
    i = 0
    while i <= n:
        if n <= 1:
            return n
        else:
            Next = Fval + Sval
            Fval = Sval
            Sval = Next
        i = i + 1
    return Next


def search(str, letter):
    if str == []:
        return 'False'
    elif str[0] == letter:
        return 'True'
    else:
        return search(str[1:], letter)


def search(str, letter):
    if str == '':
        return 'False'
    elif str[0] == letter:
        return 'True'
    else:
        return search(str[1:], letter)


def countdown(num=3):
    while num != 0:
        print(num)
        num = num - 1
    print('LIFT OFF!')

def search(word, letter):
    if letter in word:
        return True
    else:
        return False

def index(word, letter):
    if letter not in word:
        return -1
    else:
        i = 0
        while word[i] != letter:
            i = i + 1
        return i

def fibonacci(n):
    import math
    Phi = 1.61803398875
    return int((Phi ** n - (1 - Phi) ** n) / math.sqrt(5))


def index(word, letter):
    if letter not in word:
        return -1
    else:
        i = 0
        while word[i] != letter:
            i = i + 1
        return i


def search(word, letter):
    if letter in word:
        return True
    else:
        return False


def fibonacci(n):
    list = [0]
    i = 0
    while n >= len(list):
        if len(list) > 1:
            new_num = list[i] + list[i - 1]
        else:
            new_num = list[i] + 1
        list.append(new_num)
        i = i + 1
    return list[-1]


def search(str, letter):
    if str == []:
        return False
    elif str[0] == letter:
        return True
    else:
        return search(str[1:], letters)


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    if i == len(str):
        return '-1'


def search(str, letter):
    if letter in str:
        return True
    else:
        return False


def index(str, letter):
    if letter in str:
        return str.find(letter)
    else:
        return -1


def search(str, letter):
    if str == '':
        return False
    elif str[0] == letter:
        return True
    else:
        return search(str[1:], letter)


def search(str, letter):
    if letter in str:
        print('True')
    else:
        print('False')


def fibonacci(n):
    import math
    Phi = 1.61803398875
    return int((Phi ** n - (1 - Phi) ** n) / math.sqrt(5))


def countdown(num=3):
    if num != 0:
        print(num)
        countdown(num - 1)
    else:
        print('LIFT OFF!')

def search(word, letter):
    if letter in word:
        return True
    else:
        return False

def index(word, letter):
    if letter not in word:
        return -1
    else:
        i = 0
        while word[i] != letter:
            i = i + 1
        return i

def fibonacci(n):
    import math
    Phi = 1.61803398875
    return int((Phi ** n - (1 - Phi) ** n) / math.sqrt(5))


def search(str, letter):
    if str == []:
        return False
    elif str[0] == letter:
        return True
    else:
        return search(str[1:], letter)


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    a = (x2 - x1) ** 2
    b = (y2 - y1) ** 2
    dist = (a + b) ** (1 / 2)
    radius_total = r1 + r2
    return dist < radius_total

Test if two circles overlap.


Test if two circles overlap.


def search(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return True
        i = i + 1
        return False


def countdown(num=3):
    while num != 0:
        print(num)
        num = num - 1
    print('LIFT OFF!')

def search(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return True
        i = i + 1
        return False

def index(word, letter):
    if letter not in word:
        return -1
    else:
        i = 0
        while word[i] != letter:
            i = i + 1
        return i

def fibonacci(n):
    import math
    Phi = 1.61803398875
    return int((Phi ** n - (1 - Phi) ** n) / math.sqrt(5))


def countdown(num=3):
    while num != 0:
        print(num)
        num = num - 1
    print('LIFT OFF!')

def search(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return True
    i = i + 1
    return False

def index(word, letter):
    if letter not in word:
        return -1
    else:
        i = 0
        while word[i] != letter:
            i = i + 1
        return i

def fibonacci(n):
    import math
    Phi = 1.61803398875
    return int((Phi ** n - (1 - Phi) ** n) / math.sqrt(5))


def search(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return True
    i = i + 1
    return False


def index(word, letter):
    if letter not in word:
        return -1
    else:
        i = 0
        while word[i] != letter:
            i = i + 1
        return i


def search(word, letter):
    if letter in word:
        return True
    else:
        return False


def countdown(num=3):
    while num != 0:
        print(num)
        num = num - 1
    print('LIFT OFF!')

def search(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return True
        i = i + 1
    return False

def index(word, letter):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return i
        i = i + 1
    return -1

def fibonacci(n):
    import math
    Phi = 1.61803398875
    return int((Phi ** n - (1 - Phi) ** n) / math.sqrt(5))


def search(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return True
        i = i + 1
    return False


def index(word, letter):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return i
        i = i + 1
    return -1


def countdown(num=3):
    if num != 0:
        print(num)
        countdown(num - 1)
    else:
        print('LIFT OFF!')

def search(word, letter):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return True
        i = i + 1
    return False

def index(word, letter):
    if letter not in word:
        return -1
    else:
        i = 0
        while word[i] != letter:
            i = i + 1
        return i

def fibonacci(n):
    import math
    Phi = 1.61803398875
    return int((Phi ** n - (1 - Phi) ** n) / math.sqrt(5))


def search(word, letter):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return True
        i = i + 1
    return False


def index(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return i
        i = i + 1
    return -1


def countdown(num=3):
    while num != 0:
        print(num)
        num = num - 1
    print('LIFT OFF!')

def search(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return True
        i = i + 1
    return False

def index(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return i
        i = i + 1
    return -1

def fibonacci(n):
    import math
    Phi = 1.61803398875
    return int((Phi ** n - (1 - Phi) ** n) / math.sqrt(5))


def search(str, letter):
    if letter in str:
        return True
    else:
        return False


def index(str, letter):
    i = 0
    while i < len(str) and str[i] != letter:
        i = i + 1
    if i < len(str):
        return i
    else:
        return '-1'


def search(str, letter):
    if letter in str:
        print('True')


def search(str, letter):
    if letter in str:
        print('True')
    else:
        print('False')


def search(str, letter):
    if letter in str:
        return 'True'
    else:
        return 'False'


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            print(i)
        else:
            i += 1
    print('-1')


def countdown(num=3):
    while num != 0:
        print(num)
        num = num - 1
    print('LIFT OFF!')

def search(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return True
        i = i + 1
    return False

def index(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return i
        i = i + 1
    return -1

def fibonacci(n):
    a = [0, 1, 1]
    i = 3
    while i < n:
        a.append(a[i - 1] + a[i - 2])
        i = i + 1
    print(a[n])


def countdown(num=3):
    if num != 0:
        print(num)
        countdown(num - 1)
    else:
        print('LIFT OFF!')

def search(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return True
        i = i + 1
    return False

def index(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return i
        i = i + 1
    return -1

def fibonacci(n):
    import math
    Phi = 1.61803398875
    return int((Phi ** n - (1 - Phi) ** n) / math.sqrt(5))


def countdown(num=3):
    while num != 0:
        print(num)
        num = num - 1
    print('LIFT OFF!')

def search(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return True
        i = i + 1
    return False

def index(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return i
        i = i + 1
    return -1

def fibonacci(n):
    a = [0, 1, 1]
    i = 3
    while i < n:
        a.append(a[i - 1] + a[i - 2])
        i = i + 1
    return a[n]


def countdown(num=3):
    while num != 0:
        print(num)
        num = num - 1
    print('LIFT OFF!')

def search(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return True
        i = i + 1
    return False

def index(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return i
        i = i + 1
    return -1

def fibonacci(n):
    a = [0, 1, 1]
    i = 3
    while i < n:
        a.append(a[i - 1] + a[i - 2])
        i = i + 1
    a.append(a[i - 1] + a[i - 2])
    return a[n]


def fibonacci(n):
    a = [0, 1, 1]
    i = 3
    while i < n:
        a.append(a[i - 1] + a[i - 2])
        i = i + 1
    a.append(a[i - 1] + a[i - 2])
    return a[n]


def search(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return True
        i = i + 1
    return False


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        i += 1
    print('-1')


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        i += 1
    return '-1'


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return
        i += 1
    return '-1'


def fibonacci(n):
    if n == 1:
        return 1
    elif n == 0:
        return 0
    else:
        return fib(n - 1) + fib(n - 2)


def fibonacci(n):
    if n == 1:
        return 1
    elif n == 0:
        return 0
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)


def index(ls, val):
    i = 0
    while i < len(ls):
        if ls[i] == val:
            return i
        i = i + 1
    return -1


def search(ls, val, pos):
    if pos == len(ls):
        return False
    elif ls[pos] == val:
        return True
    else:
        return search(ls, val, pos + 1)


def index(str, letter1, letter2):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        i += 1
    return '-1'


def index(str, letter1, letter2):
    i = 0
    while i < len(str):
        if str[i] == letter1:
            return i
        i += 1
    return '-1'


def search(str, letter):
    if letter in str:
        return 'True'
    else:
        return 'False'


def index(str, letter1, letter2):
    i = 0
    while i < len(str):
        if str[i] == letter1:
            return i
        i += 1
    return '-1'
    i = 0
    while i < len(str):
        if str[i] == letter1:
            return i
        i += 1
    return '-1'


def index(str, letter1, letter2):
    i = 0
    while i < len(str):
        if str[i] == letter1:
            return i
        i += 1
    return '-1'
    i = 0
    while i < len(str):
        if str[i] == letter2:
            return i
        i += 1
    return '-1'


def search(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return True
        i = i + 1
    return False


def append2list(l1, l2=[]):
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1=[], l2=[]):
    for i in l1:
        l2.append(i)
    return l2


def search(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return True
        i = i + 1
    return False

def index(str, letter, pos):
    if pos == len(str):
        return False
    elif str[pos] == letter:
        return True
    else:
        return search(str, letter, pos)


def index(str, letter):
    if letter in str:
        return str.find(letter)
    else:
        return '1'


def index(str, letter):
    if letter in str:
        return str.find(letter)
    else:
        return '+1'


def index(str, letter):
    if letter in str:
        return str.find(letter)
    else:
        return '-1'


def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)


def index(str, letter):
    if letter in str:
        return 1
    else:
        return -1


Test if two circles overlap.


def append2list(l1, l2=None):
    if l2 == None:
        l2 = []
        for i in l1:
            l2.append(i)
    return l2


def append2list(l1, l2=None):
    if l2 == None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    lenradii = r1 + r2
    distbtwnpoints = sqrt((x1 - x2) ** 2 + (y2 - y1) ** 2)
    return lenradii > distbtwnpoints

Test if two circles overlap.


def fibonacci(n):
    if n < 2:
        return n
    return fibonacci(n - 2) + fib(n - 1)


def fibonacci(n):
    if n > 1:
        return fibonacci(n - 2) + fiboacci(n - 1)
    return n


def search(str, letter):
    if letter in str:
        return 'True'
    else:
        return 'False'


def fibonacci(n):
    if n == 1:
        return 1
    elif n == 0:
        return 0
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)


def append2list(l1, l2=[]):
    if l2 == None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=None):
    if l2 is None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=[]):
    l2 = l2 + l1
    return l2


def append2list(l1, l2=[]):
    for i in l1:
        l2.append(i)
    return l2


def search(str):
    if letter in str:
        return 'True'
    else:
        return 'False'


def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    elif n > 1:
        return fibonacci(n - 1) + fibonacci(n - 2)
    else:
        return -1


def index(str, letter):
    if letter in str[i]:
        return i
    else:
        return '-1'


def index(str):
    if letter in str[i]:
        return i
    else:
        return '-1'


def index(str, letter):
    if letter in str[i]:
        return [i]
    else:
        return '-1'


def index(str, letter, case):
    if letter in str[i]:
        return i
    else:
        return '-1'


def index(str, letter, i):
    if letter in str[i]:
        return i
    else:
        return '-1'


def index(str, letter, position):
    if letter in str[position]:
        return position
    else:
        return '-1'


def index(str, letter, i):
    if letter in str[i]:
        return i
        print(i)
    else:
        return '-1'


Test if two circles overlap.


def append2list(l1, l2=None):
    if l2 == None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    lenradii = r1 + r2
    distancebtwnpoints = sqrt((x1 - x2) ** 2 + (y2 - y1) ** 2)
    return lenradii > distancebtwnpoints

Test if two circles overlap.


def append2list(l1, l2=None):
    if l2 is None:
        l2 = []
        for i in l1:
            l2.append(i)
    return l2


def overlap(x1, y1, r1, x2, y2, r2):
    if (x2 - x1) ** 2 + (y2 - y1) ** -1 < r1 + r2:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    import math
    dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    if r1 + r2 >= dist:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    import math
    dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    if r1 + r2 > dist:
        return True
    else:
        return False

Test if two circles overlap.


def append2list(l1, l2=None):
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=None):
    if l2 is None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=[]):
    for i in l1:
        l2.append(i)
    return l2


def distance(x1, y1, x2, y2):
    return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)

def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    dist = distance(x1, y1, x2, y2)
    return dist < r1 + r2

Test if two circles overlap.


def overlap(x1, y1, r1, x2, y2, r2):
    dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    if dist < r1 + r2:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    if dist < r1 + r2:
        return True
    else:
        return False

Test if two circles overlap.


def append2list(l1, l2=''):
    if l2 == '':
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1=[], l2=[]):
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=None):
    if l2 is None:
        for i in l1:
            l2.append(i)
        return l2
    else:
        return l1


def append2list(l1, l2=None):
    if l2 is None:
        l2 = []
        for i in l1:
            l2.append(i)
        return l2
    else:
        return l1


def search(string, letter):
    string = input()
    letter = input()
    if letter not in string:
        print('False')
    else:
        print('True')


def search(string, letter):
    if letter not in string:
        print('False')
    else:
        print('True')


def search(string, letter):
    if letter not in string:
        return 'False'
    else:
        return 'True'


def index(sting, letter):
    if letter not in string:
        print('-1')
    if letter in string:
        a = list(string)
        print(a.index(letter))


def index(string, letter):
    if letter not in string:
        print('-1')
    if letter in string:
        a = list(string)
        print(a.index(letter))


def index(string, letter):
    if letter not in string:
        return '-1'
    if letter in string:
        a = list(string)
        return a.index(letter)


def append2list(l1, l2=None):
    if l2 is None:
        l2 = []
    l2.append(l1)
    return l2


def append2list(l1, l2=None):
    if l2 == None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=None):
    if l2 is None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    if r1 + r2 >= sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2):
        return True
    else:
        return False

Test if two circles overlap.


def append2list(l1, l2=[]):
    if l2 == 0:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=0):
    if l2 == 0:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def index(str, letter):
    if letter in str:
        return 1
    else:
        return -1


def search(str, letter):
    if letter in str:
        return 'True'
    else:
        return 'False'


def fibonacci(n):
    if n == 1:
        return 1
    elif n == 0:
        return 0
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)


def search(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return True
        i = i + 1
    return False


def index(str, letter, pos):
    if str[pos] == letter:
        print('1')
    else:
        print('-1')


def index(str, letter, pos):
    for letter in str:
        if str[pos] == letter:
            print('1')
        else:
            print('-1')


def index(str, letter):
    for letter in str:
        if letter[i] == str:
            print('1')
        else:
            print('-1')


def index(str, letter):
    i = 0
    while i < len(str):
        if letter[i] == str:
            print('1')
        else:
            print('-1')
        i = i + 1


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    dis = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    if dis < r1 + r2:
        return True
    return False

Test if two circles overlap.


def append2list(l1, l=[]):
    l2 = []
    for item in l1:
        l2.append(item)
    for item in l:
        l2.append(item)
    return l2


def append2list(l1, l2=[]):
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=[]):
    if len(l2) == 0:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    distance = (x2 - x1) ** 2 + (y2 - y1) ** 2
    if distance < (r1 + r2) ** 2:
        return True
    else:
        return False

Test if two circles overlap.


Test if two circles overlap.


def append2list(l1, l2=None):
    if l2 == None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    run = int(x1) - int(x2)
    rise = int(y1) - int(y2)
    distance = (run ** 2 + rise ** 2) ** 0.5
    return distance < r1 + r2

Test if two circles overlap.


def search(str, letter):
    if letter in str:
        print('True')
    else:
        print('False')


def append2list(l1, l2=None):
    try:
        if l2 == None:
            l2 = []
            for i in l1:
                l2.append(i)
            return l2
        else:
            return l1
    except ValueError:
        return l1


def append2list(l1, l2=None):
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=None):
    if l2 == None:
        for i in l1:
            l2.append(i)
        return l2
    else:
        return l1


def append2list(l1, l2=None):
    if l2 == None:
        l2 = []
        for i in l1:
            l2.append(i)
        return l2
    else:
        return l1


def search(str, letter):
    if letter in str:
        return 'True'
    else:
        return 'False'


def index(str, letter):
    i = 0
    while str[i] == letter:
        i = i + 1
    if i == len(str):
        return '-1'
    else:
        return i


def append2list(l1, l2=None):
    if l2 == None:
        l3 = []
        for i in l1:
            l3.append(i)
        return l3
    else:
        return l1


def index(str, letter):
    i = 0
    while str[i] != letter:
        i = i + 1
    if i == len(str):
        return '-1'
    else:
        return i


def index(str, letter):
    i = 0
    while str[i - 1] != letter:
        i = i + 1
    if i == len(str):
        return '-1'
    else:
        return i


def index(str, letter):
    i = 0
    while str[i] != letter:
        return i
        i = i + 1
    if i == len(str):
        return '-1'
    else:
        return i


def index(str, letter):
    return len(str)
    i = 0
    while str[i] != letter:
        i = i + 1
    if i == len(str):
        return '-1'
    else:
        return i


def index(str, letter):
    i = 0
    while str[i] != letter and i < len(str):
        i = i + 1
    if i == len(str):
        return '-1'
    else:
        return i


def index(str, letter):
    i = 0
    while str[i] != letter and i < len(str) - 1:
        i = i + 1
    if i == len(str):
        return '-1'
    else:
        return i


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    if math.sqrt(x2 + y2 + (x1 + y1)) > r2 + r1:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    if math.sqrt(x2 + y2 + (x1 + y1)) > math.sqrt(r2 + r1):
        return True
    else:
        return False

Test if two circles overlap.


def index(str, letter):
    i = 0
    while str[i] != letter and i < len(str) - 1:
        i = i + 1
    if i + 1 == len(str):
        return '-1'
    else:
        return i


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    if math.sqrt(x2 + y2 + (x1 + y1)) < math.sqrt(r2 + r1):
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    if math.sqrt(x2 + y2 + (x1 + y1)) < math.sqrt(r2 + r1) < math.sqrt(x2 -
        y2 + (x1 - y1)):
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    if math.sqrt(x2 - y2 + (x1 - y1)) < math.sqrt(r2 + r1) < math.sqrt(x2 +
        y2 + (x1 + y1)):
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    if math.sqrt(x2 + y2 + (x1 + y1)) < r2 + r1:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    if math.sqrt(x2 - y2 + (x1 - y1)) < r2 + r1:
        return True
    else:
        return False

Test if two circles overlap.


def fibonacci(n):
    a = [0, 1]
    total = 0
    i = 1
    while i < n:
        total = int(a[i]) + int(a[i + 1])
        a.append(total)
        i = i + 1
    return a[n]


def search(str, letter):
    if letter in str:
        return 'True'
    else:
        return 'False'


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    if math.sqrt((x2 - y2) ** 2 + (x1 - y1) ** 2) < r2 + r1:
        return True
    else:
        return False

Test if two circles overlap.


def append2list(l1, l2=None):
    if l2 == None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def fibonacci(n):
    a = [0, 1]
    total = 0
    i = 0
    while i < n + 1:
        total = int(a[i]) + int(a[i + 1])
        a.append(total)
        i = i + 1
    return a[n]


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    distance = math.sqrt(9)
    return distance

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    sumofrads = r1 + r2
    if distance < sumofrads:
        return True
    else:
        return False

Test if two circles overlap.


Test if two circles overlap.


def append2list(l1, l2=[]):
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=None):
    if l2 is None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    radiuses = r1 + r2
    distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    if distance < radiuses:
        return True
    else:
        return False

Test if two circles overlap.


def append2list(l1, l2=None):
    if l2 == None:
        l3 = []
        for i in l1:
            l3.append(i)
        return l3
    else:
        return l1


def append2list(l1, l2=None):
    if l2 is None:
        l2 = []
        for i in l1:
            l2.append(i)
        return l2
    else:
        return l1


def append2list(l1, l2=None):
    if l2 is None:
        l2 = []
        for i in l1:
            l2.append(i)
    return l2


def append2list(l1=None, l2=None):
    if l2 is None:
        l2 = []
        for i in l1:
            l2.append(i)
    return l2


_A = None

def append2list(l1=_A, l2=_A):
    if l2 is _A:
        l2 = []
        for i in l1:
            l2.append(i)
        return l2
    elif l1 is _A:
        l1 = []
        for i in l2:
            l1.append(i)
        return l1


def append2list(l1, l2=0):
    if l2 == 0:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    run = int(x1) - int(x2)
    rise = int(y1) - int(y2)
    distance = (run ** 2 + rise ** 2) ** 0.5
    return distance < r1 + r2

Test if two circles overlap.


def append2list(l1, l2=[]):
    return l2 + l1


def append2list(l1, l2=[]):
    newlist = []
    for i in l2:
        newlist.append(i)
    for i in l1:
        newlist.append(i)
    return newlist


def append2list(l1, l2):
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=None):
    if l2 is None:
        l2 = []
        l3 = l1 + l2
        return l3


def append2list(l1, l2=[]):
    if len(l2) == 2:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1=[], l2=''):
    l2 = list(l2)
    for i in l1:
        l2.append(i)
    return l2


def overlap(d1=0, d2=0, d3=0, d4=0, d5=0, d6=0):
    r = d3 + d6
    r = r * r
    d = (d1 - d4) * (d1 - d4) - (d2 - d5) * (d2 - d5)
    if r == d:
        return True
    else:
        return False

Test if two circles overlap.


Test if two circles overlap.


def overlap(d1=0, d2=0, d3=0, d4=0, d5=0, d6=0):
    r = d3 + d6
    r = r * r
    d = (d1 - d4) * (d1 - d4) - (d2 - d5) * (d2 - d5)
    if r > d:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(d1=0, d2=0, d3=0, d4=0, d5=0, d6=0):
    r = d3 + d6
    r = r * r
    d = (d1 - d4) * (d1 - d4) - (d2 - d5) * (d2 - d5)
    if r >= d:
        return True
    else:
        return False

Test if two circles overlap.


def append2list(l1, l2=None):
    l2 = []
    for i in l1:
        l2.append(i)
    return l2


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    distance = math.floor(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2))
    return r1 + r2 > distance

Test if two circles overlap.


def overlap(d1=0, d2=0, d3=0, d4=0, d5=0, d6=0):
    r = d3 + d6
    d = math.sqrt((d1 - d4) ** 2) - (d2 - d5) ** 2
    if r >= d:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(d1=0, d2=0, d3=0, d4=0, d5=0, d6=0):
    import math
    r = d3 + d6
    d = math.sqrt((d1 - d4) ** 2) - (d2 - d5) ** 2
    if r >= d:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=1):
    d = (x2 - x1) ** 2 + (y2 - y1) * 2
    if distance < (r1 + r2) ** 2:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(d1=0, d2=0, d3=0, d4=0, d5=0, d6=0):
    import math
    r = d3 + d6
    d = (d1 - d4) ** 2 - (d2 - d5) ** 2
    d = math.sqrt(d)
    if r >= d:
        return True
    else:
        return False

Test if two circles overlap.


def append2list(l1, l2=None):
    if l2 == None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    distance = (x2 - x1) ** 2 + (y2 - y1) ** 2
    if distance < (r1 + r2) ** 2:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(d1=0, d2=0, d3=1, d4=0, d5=0, d6=1):
    import math
    r = d3 + d6
    d = (d1 - d4) ** 2 - (d2 - d5) ** 2
    d = math.sqrt(d)
    if r >= d:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, x2=0, y2=0, r1=1, r2=1):
    distance = (x2 - x1) ** 2 + (y2 - y1) ** 2
    if distance < (r1 + r2) ** 2:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(d1=0, d2=0, d3=1, d4=0, d5=0, d6=1):
    import math
    r = d3 + d6
    x = (d1 - d4) ** 2
    y = (d2 - d5) ** 2
    d = x + y
    d = math.sqrt(d)
    if r >= d:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(d1=0, d2=0, d3=1, d4=0, d5=0, d6=1):
    import math
    r = d3 + d6
    x = (d1 - d4) ** 2
    y = (d2 - d5) ** 2
    d = x + y
    d = math.sqrt(d)
    if r > d:
        return True
    else:
        return False

Test if two circles overlap.


def append2list(l1, l2=None):
    if l2 is None:
        l2 = []
        l2.append(l1)
    return l2


def overlap(d1=0, d2=0, d3=1, d4=0, d5=0, d6=1):
    r = d3 + d6
    r = r ** 2
    x = (d1 - d4) ** 2
    y = (d2 - d5) ** 2
    d = x + y
    if r > d:
        return True
    else:
        return False

Test if two circles overlap.


Test if two circles overlap.


def overlap(d1=0, d2=0, d3=1, d4=0, d5=0, d6=1):
    import math
    r = d3 + d6
    d = math.sqrt((d1 - d4) ** 2 + (d2 - d5) ** 2)
    if r > d:
        return True
    else:
        return False

Test if two circles overlap.


def append2list(l1, l2=None):
    if l2 is None:
        l2 = []
        for i in l1:
            l2.append(l1)
        return l2
    else:
        return [l1, l2]


def append2list(l1, l2=0):
    if l2 is None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=[]):
    for i in l1:
        l2.append(i)
    return l2


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    distance = math.floor(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2))
    return r1 + r2 > distance

Test if two circles overlap.


def append2list(l1, l2=None):
    if l2 is None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=0):
    if l2 == 0:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=[]):
    l2 = []
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=[]):
    if l2 is None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def append2list(l1, l2=None):
    for i in l1:
        if l2 == None:
            l2 = []
            l2.append(i)
        else:
            l2.append(i)
    return l2


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    dist = (x2 - x1) ** 2 + (y2 - y1) ** 2
    if dist < (r1 + r2) ** 2:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):
    length = (x2 - x1) ** 2 + (y2 - y1) ** 2
    if length < (r1 + r2) ** 2:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    distance = (x2 - x1) ** 2 + (y2 - y1) ** 2
    if distance < (r1 + r2) ** 2:
        return True
    return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    length = (x2 - x1) ** 2 + (y2 - y1) ** 2
    if length < (r1 + r2) ** 2:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    distance = (x2 - x1) ** 2 + (y2 - y1) ** 2
    if distance < (r1 + r2) ** 2:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    radiuses = r1 + r2
    distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    if distance < radiuses:
        return True
    else:
        return False

Test if two circles overlap.


Test if two circles overlap.


def search(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return True
        i = i + 1
    return False


def index(str, letter):
    i = 0
    while i < len(str):
        index = letter.index('str')
        if str[i] == letter:
            return index
        else:
            return '-1'
        i = i + 1


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    import math
    d = (x2 - x1) ** 2 + (y2 - x1) ** 2
    if r1 + r2 >= math.sqrt(d):
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    import math
    d = math.sqrt((x2 - x1) ** 2 + (y2 - x1) ** 2)
    if r1 + r2 >= d:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    import math
    d = math.sqrt((x2 - x1) ** 2 + (y2 - x1) ** 2)
    if r1 + r2 > d:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    dis = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    if dis < r1 + r2:
        return True
    return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    import math
    r = r1 + r2
    d = math.sqrt((x2 - x1) ** 2 + (y2 - x1) ** 2)
    print((r, d))
    if r > d:
        return True
    else:
        return False

Test if two circles overlap.


def append2list(l1, l2=None):
    if l2 == None:
        l2 = []
    for i in l1:
        l2.append(i)
    return l2


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    import math
    r = r1 + r2
    d = (x2 - x1) ** 2 + (y2 - x1) ** 2
    d = math.sqrt(d)
    print((r, d))
    if r > d:
        return True
    else:
        return False

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    import math
    r = r1 + r2
    d = (x1 - x2) ** 2 + (y1 - x2) ** 2
    d = math.sqrt(d)
    print((r, d))
    if r > d:
        return True
    else:
        return False

Test if two circles overlap.


def fibonacci(n):
    a = [0, 1, 1]
    i = 3
    while i < n:
        a.append(a[i - 1] + a[i - 2])
        i = i + 1
    a.append(a[i - 1] + a[i - 2])
    return a[n]


def search(ls, val, pos):
    if pos == len(ls):
        return False
    elif ls[pos] == val:
        return True
    else:
        return search(ls, val, pos + 1)


def search(ls, val, na=0):
    pos = len(ls)
    if pos == len(ls):
        return False
    elif ls[pos] == val:
        return True
    else:
        return search(ls, val, pos + 1)

def index(ls, val, pos):
    if pos == len(ls):
        return False
    elif ls[pos] == val:
        return True
    else:
        return search(ls, val, pos + 1)


def search(ls, val, na=0):
    pos = len(ls)
    if pos == len(ls):
        return False
    elif ls[pos] == val:
        return True
    else:
        return search(ls, val, pos + 1)


def search(str, letter):
    i = 0
    if letter == str[i]:
        return 'True'
    else:
        return 'False'


def fibonacci(n):
    a = [0, 1]
    if len(a) == n + 1:
        print(a[n])
    else:
        total = int(a[n]) + int(a[n + 1])
        a.append(total)
        fibonacci(n + 1)


def fibonacci(n):
    a = [0, 1]
    if n == len(a):
        return a[n]
    else:
        total = int(a[n]) + int(a[n + 1])
        a.append(total)
        fibonacci(n + 1)


def fibonacci(n):
    a = [0, 1]
    if n < i:
        return a[n]
    else:
        i = 0
        total = int(a[i]) + int(a[i + 1])
        a.append(total)
        i = i + 1


def fibonacci(n):
    i = 0
    a = [0, 1]
    if n < i:
        return a[n]
    else:
        total = int(a[i]) + int(a[i + 1])
        a.append(total)
        i = i + 1


def fibonacci(n):
    i = 0
    original = n
    a = [0, 1]
    if n == 0:
        return a[original]
    else:
        total = int(a[i]) + int(a[i + 1])
        a.append(total)
        i = i + 1
        fibonacci(n - 1)


def fibonacci(n):
    i = 0
    a = [0, 1]
    if n == 0:
        return a[len(a)]
    else:
        total = int(a[i]) + int(a[i + 1])
        a.append(total)
        i = i + 1
        fibonacci(n - 1)


def fibonacci(n):
    i = 0
    a = [0, 1]
    if n == 0:
        return a[len(a) - 1]
    else:
        total = int(a[i]) + int(a[i + 1])
        a.append(total)
        i = i + 1
        fibonacci(n - 1)


def fibonacci(n):
    i = 0
    a = [0, 1]
    if n == 0:
        return a[len(a) - 2]
    else:
        total = int(a[i]) + int(a[i + 1])
        a.append(total)
        i = i + 1
        fibonacci(n - 1)


def fibonacci(n):
    i = 0
    a = [0, 1]
    if n == 0:
        return a[len(a) - 2]
    else:
        total = 0
        total = int(a[i]) + int(a[i + 1])
        a.append(total)
        i = i + 1
        fibonacci(n - 1)


def fibonacci(n):
    i = 0
    a = [0, 1]
    if n == 0:
        return a[len(a) - 2]
    else:
        total = 0
        total = int(a[i]) + int(a[i + 1])
        a.append(total)
        i = i + 1
        return n
        fibonacci(n - 1)


def search(str, letter):
    i = 0
    if letter == str[i]:
        return 'True'
    else:
        return 'False'
        i = i + 1


def fibonacci(n):
    i = 0
    a = [0, 1]
    if n == 0:
        return a[len(a)]
    else:
        total = 0
        total = int(a[i]) + int(a[i + 1])
        a.append(total)
        i = i + 1
        fibonacci(n - 1)


def search(str, letter):
    if str == []:
        return False
    elif str[0] == letter:
        return True
    else:
        return search(str[1:], letter)


def search(str, letter):
    if str == []:
        return 'False'
    elif str[0] == letter:
        return 'True'
    else:
        return search(str[1:], letter)


def search(str, letter):
    if str == []:
        return False
    elif str[0] == letter:
        return True
    else:
        search(str[1:], letter)


def search(str, letter):
    if len(str) == 0:
        return False
    elif str[0] == letter:
        return True
    else:
        return search(str[1:], letter)


def search(str, letter):
    if len(str) == 0:
        return False
    elif str[0] == letter:
        return True
    else:
        return search(str[1:], letter)

def index(str, letter):
    if len(str) == 0:
        return -1
    elif str[0] == letter:
        return
    else:
        return search(str[1:], letter)


def search(str, letter):
    if len(str) == 0:
        return False
    elif str[0] == letter:
        return True
    else:
        return search(str[1:], letter)

def index(str, letter):
    if len(str) == 0:
        return -1
    elif str[len(str)] == letter:
        return len(str)
    else:
        return search(str[:len(str)], letter)


def index(str, letter):
    if len(str) == 0:
        return -1
    elif str[len(str)] == letter:
        return len(str)
    else:
        return index(str[:len(str)], letter)


def index(str, letter):
    if len(str) == 0:
        return -1
    elif str[len(str)] == letter:
        return int(len(str))
    else:
        return index(str[:len(str)], letter)


def index(str, letter):
    if len(str) == 0:
        return -1
    elif str[len(str)] == letter:
        print(int(len(str)))
    else:
        return index(str[:len(str)], letter)


def search(str, letter):
    if letter in str:
        return 'True'
    else:
        return 'False'


def index(str, letter):
    i = 0
    while str[i] != letter and i < len(str) - 1:
        i = i + 1
    if i + 1 == len(str):
        return '-1'
    else:
        return i