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


def index(str, letter):
    i = 0
    if letter in str:
        letter = letter[0]

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


def countdown(num):
    while num >= 1:
        time.sleep(0.1)
        print(num)
        num = num - 1
        if num == 0:
            time.sleep(0.1)
            print('LIFT OFF!')


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

Iteratively search for a letter in a string

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


def index(str, letter):
    for item in str:
        if item == letter:
            return item
    return '-1'


def countdown(num):
    if int(num) == 1:
        print(num)
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(0.1)
        countdown(int(num) - 1)


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


def countdown(num):
    while num >= 1:
        print(num)
        num = num - 1
        time.sleep(0.1)


def countdown(num):
    while num >= 1:
        print(num)
        num = num - 1
        time.sleep(0.1)

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

def index(str, letter):
    i = 0
    if letter in str:
        letter = letter[0]


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


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


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


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


def countdown(num):
    while num >= 1:
        print(num)
        time.sleep(0.1)
        num -= 1
    print('LIFT OFF!')


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        i = i + 1
    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
        i = i + 1
    return '-1'


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


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


def countdown(count):
    while count >= 1:
        print(count)
        time.sleep(0.1)
        count -= 1


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

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


def countdown(num):
    i = num
    while i > 0:
        print(i)
        time.sleep(0.1)
        i = i - 1
    print('LIFT OFF!')


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


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


def fibonacci(n):
    i = 0
    num = 1
    num1 = 1
    num2 = 1
    while i < n:
        if n == 0:
            return 0
        elif n == 1:
            return 1
        num = num3 + num2
        num2 = num3
        num3 = num
        i = i + 1
    if n != 0 and n != 1:
        return num


def fibonacci(n):
    i = 0
    num = 1
    num1 = 1
    num2 = 1
    while i < n:
        if n == 0:
            return 0
        elif n == 1:
            return 1
        num = num2 + num1
        num1 = num2
        num2 = num
        i = i + 1
    if n != 0 and n != 1:
        return num


def countdown(count):
    while count >= 1:
        print(count, 'LIFT OFF!\n')
        time.sleep(0.1)
        count -= 1


def fibonacci(n):
    i = 0
    num = 1
    num1 = 1
    num2 = 1
    if n == 0:
        return 0
    elif n == 1:
        return 1
    while i < n:
        num = num2 + num1
        num1 = num2
        num2 = num
        i = i + 1
    if n != 0 and n != 1:
        return num


def countdown(count):
    while count >= 1:
        print(count, 'LIFT OFF!')
        time.sleep(0.1)
        count -= 1


def countdown(count):
    while count >= 1:
        print(count, end=' ')
        time.sleep(0.1)
        count -= 1


def countdown(num):
    while num >= 1:
        print(num)
        time.sleep(0.1)
        num -= 1
    print('LIFT OFF!')
    return num


def fibonacci(n):
    if n == 0:
        return '0'
    elif n == 1:
        return '1'
    else:
        n1 = 1
        n2 = 0
        i = 2
        while i < n:
            sum1 = n1 + n2
            n2 = n1
            n1 = sum1
            i += 1
        return sum1


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


def countdown(num):
    i = 0
    x = num
    while i < num:
        print(x)
        time.sleep(0.1)
        x = x - 1
        i = i + 1


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


def fibonacci(n):
    if n == 0:
        return '0'
    elif n == 1:
        return '1'
    else:
        n1 = 1
        n2 = 0
        i = 2
        while i <= n:
            sum1 = n1 + n2
            n2 = n1
            n1 = sum1
            i += 1
        return sum1


def fibonacci(n):
    i = 0
    num = 1
    num1 = 1
    num2 = 1
    if n == 0:
        return 0
    elif n == 1:
        return 1
    while i < n:
        num = num2 + num1
        num1 = num2
        num2 = num
        print(num)
        i = i + 1
    if n != 0 and n != 1:
        return num


def countdown(num):
    i = 0
    x = num
    while i < num:
        print(x)
        time.sleep(0.1)
        x = x - 1
        i = i + 1
    print('LIFT OFF!')


def fibonacci(n):
    i = 2
    num = 1
    num1 = 1
    num2 = 1
    if n == 0:
        return 0
    elif n == 1:
        return 1
    while i < n:
        num = num2 + num1
        num1 = num2
        num2 = num
        print(num)
        i = i + 1
    if n != 0 and n != 1:
        return num


def countdown(num):
    i = num
    while i > 0:
        print(i)
        time.sleep(0.1)
        i = i - 1
    print('LIFT OFF!')


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


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


def fibonacci(n):
    i = 2
    num = 1
    num1 = 1
    num2 = 1
    if n == 0:
        return 0
    elif n == 1:
        return 1
    while i < n:
        num = num2 + num1
        num1 = num2
        num2 = num
        i = i + 1
    if n != 0 and n != 1:
        return num


def countdown(num):
    while num >= 1:
        time.sleep(0.1)
        print(num)
        num = num - 1
        if num == 0:
            time.sleep(0.1)
            print('LIFT OFF!')


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


def countdown(count):
    while count >= 1:
        print(count)
        time.sleep(0.1)
        count -= 1
    print('LIFT OFF!')


def countdown(num):
    while num >= 1:
        print(num)
        time.sleep(0.1)
        num -= 1
    print('LIFT OFF!')


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


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


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


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


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


def search(ls, val):
    for item in ls:
        if item == val:
            return True
    return False


def countdown(num):
    while num >= 1:
        print(num)
        time.sleep(0.1)
        num -= 1
    print('LIFT OFF!')
    return num


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

Recursively search for a letter in a string


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

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


def fibonacci(n):
    if n == 0:
        return '0'
    elif n == 1:
        return '1'
    else:
        n1 = 1
        n2 = 0
        i = 2
        while i <= n:
            sum1 = n1 + n2
            n2 = n1
            n1 = sum1
            i += 1
        return sum1

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


def countdown(num):
    while num >= 1:
        print(num)
        num = num - 1
        time.sleep(0.1)


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


def index(str, letter):
    i = 0
    if letter in str:
        c = letter[0]
        for ch in str:
            if ch == c:
                if str[i:i + len(letter)] == letter:
                    return i
            i += 1
    return -1


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


def countdown(num):
    while num >= 1:
        print(num)
        num = num - 1
        time.sleep(0.1)
    print('LIFT OFF!')


def countdown(count):
    while count >= 1:
        print(count)
        time.sleep(0.1)
        count -= 1
    print('LIFT OFF!')


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


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


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


def countdown(num):
    while num >= 1:
        print(num)
        time.sleep(0.1)
        num -= 1
    print('LIFT OFF!')


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


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


def search(ls, val):
    for item in ls:
        if item == val:
            return True
    return False


def index(str, letter):
    for item in ls:
        return str - 1


def countdown(num):
    while num >= 1:
        time.sleep(0.1)
        print(num)
        num = num - 1
        if num == 0:
            time.sleep(0.1)
            print('LIFT OFF!')


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


def index(str, letter):
    for item in ls:
        return str - 1
    return index


def index(str, letter):
    for item in str:
        return str - 1


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


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


def countdown(num):
    if int(num) == 1:
        print(num)
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(0.1)
        countdown(int(num) - 1)


def index(ls, letter):
    for item in ls:
        if item == -1:
            return ls


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


def countdown(count):
    while count >= 1:
        print(count)
        time.sleep(0.1)
        count -= 1
    print('LIFT OFF!')


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


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


def index(ls, letter):
    for item in ls:
        if item == -1:
            return index


def countdown(num):
    while num >= 1:
        print(num)
        num = num - 1
        time.sleep(0.1)
    print('LIFT OFF!')


def index(str, letter):
    i = 0
    if letter in str:
        c = letter[0]
        for ch in str:
            if ch == c:
                if str[i:i + len(letter)] == letter:
                    return i
            i += 1
    return -1


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


def countdown(num):
    if num == 1:
        print(num)
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(0.1)
        countdown(num - 1)


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


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


def countdown(num):
    while num >= 1:
        time.sleep(0.1)
        print(num)
        num = num - 1
        if num == 0:
            time.sleep(0.1)
            print('LIFT OFF!')


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


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


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


def countdown(num):
    i = 0
    x = num
    while i < 1:
        print(x)
        time.sleep(0.1)
        x = x - 1
        i = i + 1
    print('LIFT OFF')


def search(string, letter, count):
    i = 0
    if string[i] == letter:
        return True
    else:
        count = i + 1
        search(string[count], letter, count)


def search(string, letter):
    i = 0
    if string[i] == letter:
        return True
    else:
        count = i + 1
        search(string[count], letter, count)


def search(string, *letter):
    i = 0
    if string[i] == letter[0]:
        return True
    else:
        count = i + 1
        search(string[count], letter[0])


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


def countdown(count):
    while count >= 1:
        print(count)
        time.sleep(0.1)
        count -= 1
    print('LIFT OFF!')


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


def search(string, letter):
    if not i:
        i = 0
    if string[i] == letter:
        return True
    else:
        search(string[i + 1], letter)


def search(string, letter):
    if i not in search():
        i = 0
    if string[i] == letter:
        return True
    else:
        search(string[i + 1], letter)


def search(string, letter):
    if 'i' not in locals():
        i = 0
    if string[i] == letter:
        return True
    else:
        search(string[i + 1], letter)


def search(string, letter):
    if 'i' not in locals():
        i = 0
    if string[i] == letter:
        return True
    elif i < len(string):
        search(string[i + 1], letter)


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


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


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


def fibonacci(n):
    i = 0
    while i < len(n - 1):
        if n + 1 == n + 2:
            return i
        i += 1


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


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


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


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


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


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


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


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


def countdown(count):
    while count >= 1:
        print(count)
        time.sleep(0.1)
        count -= 1
    print('LIFT OFF!')


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


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


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


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


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


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


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


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


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


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


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


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


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


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


def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        a = 0
        b = 1
    i = 2
    while i <= n:
        sum1 = a + b
        a = b
        b = sum1
        i += 1
    return sum1


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


def countdown(num):
    while num >= 1:
        time.sleep(0.1)
        print(num)
        num = num - 1
        if num == 0:
            time.sleep(0.1)
            print('LIFT OFF!')


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


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


def countdown(count):
    while count >= 1:
        print(count)
        time.sleep(0.1)
        count -= 1
    print('LIFT OFF!')


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


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


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


def countdown(num):
    i = 0
    while num > i:
        print(num)
        time.sleep(0.1)
        num -= 1


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


def fibonacci(n):
    old = 1
    cur = 1
    i = 1
    while i < n:
        cur, old, i = cur + old, cur, i + 1
    return cur


def index(str, letter):
    start = len(str) - 1
    end = -1
    while start > end:
        if letter == str[start]:
            return start
        else:
            start -= 1
    return end


def countdown(num):
    i = 0
    while num > i:
        print(num)
        time.sleep(0.1)
        num -= 1
    print('LIFT OFF!')


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


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


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


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


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


def countdown(num):
    if num == 1:
        print(num)
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(0.1)
        countdown(num - 1)


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


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


def index(string, letter, count):
    print(count)
    if count == len(string) - 1:
        return -1
    elif string[count] == letter:
        return count
    else:
        index(string, letter, count + 1)


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


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


def index(string, letter, count):
    print(count)
    k = len(string)
    if count == k:
        return -1
    elif string[count] == letter:
        return count
    else:
        index(string, letter, count + 1)


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


def index(string, letter, count):
    print(count)
    k = len(string)
    if count == k:
        print(-1)
    elif string[count] == letter:
        print(count)
    else:
        index(string, letter, count + 1)


def index(string, letter, count):
    k = len(string)
    if count == k:
        print(-1)
    elif string[count] == letter:
        print(count)
    else:
        index(string, letter, count + 1)


def index(string, letter, count):
    print(count)
    k = len(string)
    if count == k:
        return -1
    elif string[count] == letter:
        return count
    else:
        return index(string, letter, count + 1)


def index(string, letter, count):
    k = len(string)
    if count == k:
        return -1
    elif string[count] == letter:
        return count
    else:
        return index(string, letter, count + 1)


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


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


def countdown(num):
    if num == 0:
        time.sleep(0.1)
        print('LIFT OFF!')
    else:
        time.sleep(0.1)
        print(num)
        countdown(num - 1)


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


def index(str, letter):
    start = len(str) - 1
    end = -1
    while start > end:
        if letter == str[start]:
            return start
        else:
            start -= 1
    return end


def countdown(num):
    i = 0
    while num > i:
        print(num)
        time.sleep(0.1)
        num -= 1
    print('LIFT OFF!')


def fibonacci(n):
    old = 1
    cur = 1
    i = 1
    while i < n:
        cur, old, i = cur + old, cur, i + 1
    return cur


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


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


def fibonacci(n):
    i = 0
    while n > i:
        n


def fibonacci(n):
    if n == 0:
        return n
    elif n == 1:
        return n
    else:
        a = 0
        b = 1
        i = 2
        while i <= n:
            sum1 = a + b
            a = b
            b = sum1
            i += 1
        return sum1


def countdown(num):
    while num >= 1:
        print(num)
        time.sleep(0.1)
        num -= 1
    print('LIFT OFF!')


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


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


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


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


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


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):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)


def countdown(num):
    if num == 0:
        time.sleep(0.1)
        print('LIFT OFF!')
    else:
        time.sleep(0.1)
        print(num)
        countdown(num - 1)


def countdown(num):
    if num > 0:
        print(num)
        time.sleep(0.1)
        num = num - 1
        countdown(num)
    else:
        print('TAKE OFF!')


def countdown(num):
    if num > 0:
        print(num)
        time.sleep(0.1)
        num = num - 1
        countdown(num)
    else:
        print('LIFT OFF!')


def index(str, letter):
    a = len(str) - 1
    b = -1
    if letter == str[a]:
        return start
    else:
        a -= 1
        index(str, letter)


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


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


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


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]:
                return i
            i += 1
    else:
        return '-1'


def countdown(num):
    while num > 0:
        print(num)
        time.sleep(0.1)
        num -= 1
    return 'LIFT OFF!'


def countdown(num):
    while num > 0:
        print(num)
        time.sleep(0.1)
        num -= 1
    print('LIFT OFF!')


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

Swap the keys of a dictionary with its values.


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

Swap the keys of a dictionary with its unique values.


def countdown(num):
    import time
    while num > 0:
        print(num)
        time.sleep(0.1)
    num -= 1


def countdown(num):
    import time
    while num > 0:
        print(num)
        time.sleep(0.1)
        num -= 1


def countdown(num):
    import time
    while num > 0:
        print(num)
        time.sleep(0.1)
        num -= 1
    print('LIFT OFF!')


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


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


def search(str, letter):
    i = 0
    while i < len(str):
        if letter == str[i]:
            break
            print('True')
        else:
            print('False')


def search(str, letter):
    i = 0
    while i < len(str):
        if letter == str[i]:
            print('True')
        else:
            print('False')


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


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


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


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


def index(str, letter):
    return str.index(letter)


def index(str, letter):
    return str.find(letter)


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


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


def index(str, letter, n):
    return str.find(letter)


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

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


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


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


def index(string, letter, pos=0):
    if string == '':
        return '-1'
    elif string[0] == letter:
        return pos
    else:
        pos += 1
        return index(string[1:], letter, pos=pos)


def countdown(num):
    if num == 0:
        return 'LIFT OFF!'
    else:
        print(num)
        num = num - 1
        time.sleep(0.1)
        return countdown(num)


def countdown(num):
    if num == 0:
        print('LIFT OFF!')
    else:
        print(num)
        num = num - 1
        time.sleep(0.1)
        return countdown(num)


def countdown(num):
    i = num
    while i > 1:
        return i
    i = i - 1


def countdown(num):
    i = num
    while i > 1:
        return i
        i = i - 1


Reverse a list of elements by swapping its elements.


def reverse(a):
    i = len(a) - 1
    new_array = []
    while i >= 0:
        new_array.append(a[i])
        i -= 1
    return new_array


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


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


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


def countdown(count):
    while count >= 1:
        print(count)
        time.sleep(0.1)
        count -= 1
    print('LIFT OFF!')


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


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


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


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


def fibonacci(n):
    i = 0
    while i < len(n):
        if n[i] == 0:
            return i
        i += 1
    return c
    c = i + 1


def fibonacci(n):
    i = 0
    while i < len(n):
        if n[i] == 0:
            return i
        i += 1
    return c
    c = i + 1

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


def fibonacci(n):
    i = 0
    while i < n:
        if n[i] == 0:
            return i
        i += 1
    return c
    c = i + 1

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


def fibonacci(n):
    i = 0
    while i < n:
        if n[i] == 0:
            return i
        i += 1
    return c
    c = i + 1


def fibonacci(n):
    i = 0
    c = i + 1
    while i < n:
        if n[i] == 0:
            return i
        i += 1
    return c


def fibonacci(n):
    i = 0
    c = i + 1
    while i < n:
        if n[i] == 0:
            return i
        i += 1
    return c

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


def fibonacci(n):
    i = 0
    c = i + 1
    while i < n:
        if n == 0:
            return i
        i += 1
    return c


def fibonacci(n):
    i = 0
    c = i + 1
    while i < n:
        if n == 0:
            return i
        i += 1
    return c

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


def fibonacci(n):
    i = 0
    x = 1
    c = i + x
    while i < n:
        if n == 0:
            return i
        i += 1
    return c

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


def fibonacci(n):
    i = 0
    x = 1
    c = i + x
    while i < n:
        if n == 0:
            return i
        i += 1
    return c


def fibonacci(n):
    i = 0
    x = 1
    c = i + x
    while i < n:
        if n == 0:
            return i
        i += 1
    c += 1
    return c

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


def fibonacci(n):
    i = 0
    x = 1
    c = i + x
    while i < n:
        if n == 0:
            return i
        i += 1
    c += 1
    return c


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


def countdown(count):
    while count >= 1:
        print(count)
        time.sleep(0.1)
        count -= 1
    print('LIFT OFF!')


def fibonacci(n):
    i = 0
    x = 1
    c = i + x
    while i < n:
        if n == 0:
            return i
        i += 1
        c += 1
    return c

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


def fibonacci(n):
    i = 0
    x = 1
    c = i + x
    while i < n:
        if n == 0:
            return i
        i += 1
        c += 1
    return c


def fibonacci(n):
    fib = [0, 1, 1]
    for f in range(2, n):
        fib.append(fib[-1] + fib[-2])
    return fib[n]

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


def fibonacci(n):
    fib = [0, 1, 1]
    for f in range(2, n):
        fib.append(fib[-1] + fib[-2])
    return fib[n]


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


def countdown(num):
    while num >= 1:
        print(num)
        num = num - 1
        time.sleep(0.1)
    print('LIFT OFF!')


def index(str, letter):
    i = 0
    if letter in str:
        c = letter[0]
        for ch in str:
            if ch == c:
                if str[i:i + len(letter)] == letter:
                    return i
            i += 1
    return -1


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


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


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


def countdown(num):
    print('calling countdown(' + str(num) + ')')
    while num > 0:
        time.sleep(0.1)
        print(num)
        num -= 1
    print('LIFT OFF!')


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


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


def countdown(num):
    while num > 0:
        time.sleep(0.1)
        print(num)
        num -= 1
    print('LIFT OFF!')


def index(s, letter):
    if letter in s:
        print(str.index(letter))
    else:
        print(-1)


def search(s, letter):
    if letter in s:
        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


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


def countdown(num):
    if int(num) == 1:
        print(num)
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(0.1)
        countdown(int(num) - 1)


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


def index(s, letter):
    if letter in s:
        print(s.index(letter))
    else:
        print(-1)


def countdown(count):
    while count >= 1:
        print(count)
        time.sleep(0.1)
        count -= 1
    print('LIFT OFF!')


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


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


def fibonacci(n):
    fib = [0, 1, 1]
    for f in range(2, n):
        fib.append(fib[-1] + fib[-2])
    return fib[n]


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


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


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


def countdown(num):
    while num > 0:
        time.sleep(0.1)
        return num
        num -= 1
    return 'LIFT OFF!'


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


def countdown(num):
    while num > 0:
        time.sleep(0.1)
        print(num)
        num -= 1
    print('LIFT OFF!')


def countdown(num):
    if num == 0:
        print('LIFT OFF!')
        return
    time.sleep(0.1)
    print(num)
    countdown(num - 1)


def index(s, letter, num):
    if num == len(s):
        print(-1)
        return
    if s[num] == letter:
        print(num)
        return
    index(s, letter, num + 1)


def index(s, letter, num):
    if num == len(s):
        return -1
    if s[num] == letter:
        return num
    index(s, letter, num + 1)


def index(s, letter, num):
    if num == len(s):
        return -1
    if s[num] == letter:
        return num
    n = index(s, letter, num + 1)
    return n


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


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


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


def countdown(num):
    if num == 1:
        print(num)
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(0.1)
        countdown(num - 1)


def fibonacci(n):
    i = 1
    z = 0
    x = 0
    while i < n - i:
        x = i
        i = i + z
        z = x
    print(i)


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


def fibonacci(n):
    i = 1
    z = 0
    x = 0
    print(i)
    print(z)
    print(x)
    while i < n - i:
        x = i
        i = i + z
        z = x
    print(i)


def fibonacci(n):
    i = 1
    z = 0
    x = 0
    while i < n - i:
        x = i
        i = i + z
        z = x
        print(i)
        print(z)
        print(x)
    print(i)


def fibonacci(n):
    i = 1
    z = 0
    x = 0
    while i < n - i:
        x = i
        i = i + z
        z = x
    print(str(i))


def fibonacci(n):
    i = 1
    z = 0
    x = 0
    while i < n:
        x = i
        i = i + z
        z = x
        print(i)
        print(z)
        print(x)
    print(str(i))


def fibonacci(n):
    i = 1
    z = 0
    x = 0
    while i < n:
        x = i
        i = i + z
        z = x
    return i


def fibonacci(n):
    i = 1
    z = 0
    x = 0
    while i < n:
        x = i
        i = i + z
        z = x
    return x


def fibonacci(n):
    i = 1
    z = 0
    x = 0
    while i < n:
        x = i
        i = i + z
        z = x
    return z


def fibonacci(n):
    i = 1
    z = 0
    x = 0
    if n > 0:
        while i < n:
            x = i
            i = i + z
            z = x
        return z
    else:
        return 0


def fibonacci(n):
    i = 1
    z = 0
    x = 0
    if n > 0:
        while i < n:
            x = i
            i = i + z
            z = x
        return i
    else:
        return 0


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


def index(str, letter):
    i = 0
    if letter in str:
        c = letter[0]
        for ch in str:
            if ch == c:
                if str[i:i + len(letter)] == letter:
                    return i
            i += 1
    return -1


def countdown(num):
    while num >= 1:
        print(num)
        num = num - 1
        time.sleep(0.1)
    print('LIFT OFF!')


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


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


def countdown(num):
    while num > 1:
        print(num)
        num -= num
        time.sleep(0.1)
    print('LIFT OFF!')


def index(str, letter):
    i = 0
    if letter in str:
        x = letter[0]
        for ch in str:
            if ch == x:
                if str[i:i + len(letter)] == letter:
                    return i
            i += 1
    return -1


def countdown(num):
    while num >= 1:
        print(num)
        num -= num
        time.sleep(0.1)
    print('LIFT OFF!')


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


def countdown(count):
    while count >= 1:
        print(count)
        time.sleep(0.1)
        count -= 1
    print('LIFT OFF!')


def fibonacci(n):
    fib = [0, 1, 1]
    for f in range(2, n):
        fib.append(fib[-1] + fib[-2])
    return fin[n]


def search(ls, val):
    for item in ls:
        if item == val:
            return True
    return False


def fibonacci(n):
    fib = [0, 1, 1]
    for f in range(2, n):
        fib.append(fib[-1] + fib[-2])
    return fib[n]


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


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


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


def countdown(num):
    import time
    i = 0
    while i < num:
        time.sleep(0.1)
        print(num - i)
        i = i + 1
    print('LIFT OFF!')


def search(x, letter):
    if letter.isalpha() and type(x) == str:
        print('ok')
    else:
        print('false')


def search(x, letter):
    if letter.isalpha() and type(x) == str:
        print('True')
    else:
        print('False')


def search(x, letter):
    if letter.isalpha() and type(x) == str:
        print('True')
    else:
        print('False')
    return


def search(x, letter):
    if letter.isalpha() and type(x) == str:
        return 'True'
    else:
        return 'False'


def search(x, letter):
    if type(x) == str and letter.isalpha():
        return 'True'
    else:
        return 'False'


def search(string, letter):
    i = 0
    while i < len(string):
        if letter in string:
            return 'True'
        else:
            return 'False'


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


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


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


def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        a = 0
        b = 1
    i = 2
    while i <= n:
        sum1 = a + b
        a = b
        b = sum1
        i += 1
    return sum1


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


def countdown(num):
    if unt(num) == 1:
        print(num)
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(0.1)
        countdown(int(num) - 1)


def countdown(num):
    i = num
    while i > 1:
        print(i)
    i = i - 1
    return i


def countdown(num):
    i = num
    while i > 1:
        print(i)
        i = i - 1
    return i


def countdown(num):
    i = num
    while i >= 1:
        print(i)
        time.sleep(0.1)
        i = i - 1
    print('LIFT OFF!')
    return i


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


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


def countdown(num):
    if int(num) == 1:
        print(num)
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(0.1)
        countdown(int(num) - 1)


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


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


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


def countdown(num):
    if num == 1:
        print(num)
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(0.1)
        countdown(num - 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 letter in str:
            return i
        else:
            return '-1'


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


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


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


def countdown(num):
    if num > 0:
        print(num)
        time.sleep(0.1)
        num = num - 1
        countdown(num)
    else:
        print('LIFT OFF!')


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


def fibonacci(n):
    if n == 0:
        return '0'
    elif n == 1:
        return '1'
    else:
        n1 = 1
        n2 = 0
        i = 2
    while i < n:
        sum1 = n1 + n2
        n2 = n1
        n1 = sum1
        i = i + 1
        return sum1


def fibonacci(n):
    if n == 0:
        return '0'
    elif n == 1:
        return '1'
    else:
        n1 = 1
        n2 = 0
        i = 2
    while i <= n:
        sum1 = n1 + n2
        n2 = n1
        n1 = sum1
        i = i + 1
        return sum1


def countdown(num):
    i = num
    while i >= 1:
        print(i)
        time.sleep(0.1)
        i = i - 1
    print('LIFT OFF!')
    return i


def fibonacci(n):
    if n == 0:
        return '0'
    elif n == 1:
        return '1'
    else:
        n1 = 1
        n2 = 0
        i = 2
        while i <= n:
            sum1 = n1 + n2
            n2 = n1
            n1 = sum1
            i = i + 1
        return sum1


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


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


def countdown(num):
    if int(num) == 1:
        print(num)
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(0.1)
        countdown(int(num) - 1)


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


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


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


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


def countdown(num):
    if num == 0:
        time.sleep(0.1)
        print('LIFT OFF!')
    else:
        time.sleep(0.1)
        print(num)
        countdown(num - 1)


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):
    for item in str:
        return True
    return False


def countdown(num):
    if int(num) == 1:
        print(num)
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(1)
        countdown(int(a) - 1)


def countdown(num):
    if int(num) == 1:
        print(num)
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(1)
        countdown(int(num) - 1)


def countdown(num):
    import time
    i = 0
    while i < num:
        print(num - i)
        time.sleep(0.1)
        i = i + 1
    print('LIFT OFF!')


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 search(str, letter):
    for n in str:
        if n == letter:
            return True
    return False


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


def countdown(num):
    if num == 1:
        print(num)
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(0.1)
        countdown(int(num - 1))


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


def countdown(num):
    if num == 1:
        print(num)
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(0.1)
        countdown(int(num) - 1)


def countdown(number):
    while number >= 1:
        time.sleep(0.1)
        print(number)
        num = num - 1
        if num == 0:
            time.sleep(0.1)
            print('LIFT OFF')


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


def countdown(num):
    while number >= 1:
        time.sleep(0.1)
        print(number)
        num = num - 1
        if num == 0:
            time.sleep(0.1)
            print('LIFT OFF')


def countdown(num):
    while num >= 1:
        time.sleep(0.1)
        print(number)
        num = num - 1
        if num == 0:
            time.sleep(0.1)
            print('LIFT OFF')


def countdown(num):
    while num >= 1:
        time.sleep(0.1)
        print(num)
        num = num - 1
        if num == 0:
            time.sleep(0.1)
            print('LIFT OFF')


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


def countdown(num):
    while num >= 1:
        time.sleep(0.1)
        print(num)
        num = num - 1
        if num == 0:
            time.sleep(0.1)
            print('LIFT OFF!')


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


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


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


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


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


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


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


def fibonacci(n):
    fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
    while fib[n]:
        num = fib[n - 1] + fib[n - 2]
        return num


def countdown(num):
    import time
    i = 0
    while i < num:
        print(num - i)
        time.sleep(0.1)
        i = i + 1
    print('LIFT OFF!')


def fibonacci(n):
    fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
    while fib[n]:
        if n == 0:
            num = fib[0]
        elif n == 1:
            num = fib[1]
        else:
            num = fib[n - 1] + fib[n - 2]
        return num


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


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


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


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


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


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


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


def countdown(num):
    import time
    i = 0
    while i < num:
        print(num - i)
        time.sleep(0.1)
        i = i + 1
    print('LIFT OFF!')
    countdown()


def countdown(num):
    import time
    i = 0
    while i < num:
        print(num - i)
        time.sleep(0.1)
        i = i + 1
    print('LIFT OFF!')
    countdown(num)


def countdown(num):
    import time
    i = 0
    while i < num:
        print(num - i)
        time.sleep(0.1)
        i = i + 1
    print('LIFT OFF!')
    countdown(num - 1)


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


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


def countdown(num):
    while num >= 1:
        time.sleep(0.1)
        print(num)
        num = num - 1
        if num == 0:
            time.sleep(0.1)
            print('LIFT OFF!')


def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        a = 0
        b = 1
    i = 2
    while i <= n:
        sum1 = a + b
        a = b
        b = sum1
        i += 1
    return sum1


def countdown(num):
    if num == 0:
        time.sleep(0.1)
        print('LIFT OFF!')
    else:
        time.sleep(0.1)
        print(num)
        countdown(num - 1)


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


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


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


def countdown(num):
    if num == 1:
        print(num)
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(0.1)
        countdown(num - 1)


def fibonacci(n):
    i = 1
    z = 0
    x = 0
    if n > 0:
        while i < n:
            x = i
            i = i + z
            z = x
        return i
    else:
        return 0


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


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


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


def countdown(num):
    import datetime
    while num != 0:
        print(num)
        time.sleep(0.1)
        num = num - 1
    print('LIFT OFF!')


def countdown(num):
    import time
    while num != 0:
        print(num)
        time.sleep(0.1)
        num = num - 1
    print('LIFT OFF!')


def index(str, letter):
    i = 0
    while i < len(str):
        if str[i] == letter:
            return i
        else:
            i = i + 1
    if i == len(str) and str[i] != letter:
        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 countdown(num):
    if int(num) == 1:
        print(num)
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(0.1)
        countdown(int(num) - 1)


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


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


def countdown(num):
    time.sleep(0.1)
    if num > 0:
        print(num)
        countdown(num - 1)
        time.sleep(0.1)
    else:
        print('LIFT OFF!')


def index(steve, letter):
    return steve.find(letter)


def fibonacci(n):
    l = []
    if n <= 1:
        return n
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)


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


def search(s, letter, pos):
    if pos == len(s):
        print('False')
    elif s[pos] == letter:
        print('True')
    else:
        return search(s, letter, pos + 1)


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


def index(steve, letter, n):
    if letter != steve[n]:
        index(steve, letter, n + 1)
    else:
        return n


def search(s, letter, pos):
    if pos == len(s):
        print('-1')
    elif s[pos] == letter:
        print(pos)
    else:
        return search(s, letter, pos + 1)


def search(s, letter, pos):
    if pos == len(s):
        print('-1')
    elif s[pos] == letter:
        return pos
    else:
        return search(s, letter, pos + 1)


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


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


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


def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        a = 0
        b = 1
    i = 2
    while i <= n:
        sum1 = a + b
        a = b
        b = sum1
        i += 1
    return sum1


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


def count_letters(s):
    if not s:
        return 0
    return 1 + count_letters(s[1:])

Return the number of lettres in a string.

assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13


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


def maximum(l):
    if len(l) == 1:
        return l[0]
    tail_max = maximum(l[1:])
    return l[0] if l[0] > tail_max else tail_max

Return the maximum element in a list of numbers.


def minimum(l):
    if len(l) == 1:
        return l[0]
    tail_min = minimum(l[1:])
    return l[0] if l[0] < tail_min else tail_min

Return the minimum element in a list of numbers.


def power(m, n):
    if not n:
        return 1
    return m * power(m, n - 1)


def partition(A, p, r):
    q = j = p
    while j < r:
        if A[j] <= A[r]:
            A[q], A[j] = A[j], A[q]
            q += 1
        j += 1
    A[q], A[r] = A[r], A[q]
    return q

def quicksort(A, p, r):
    if r <= p:
        return
    q = partition(A, p, r)
    quicksort(A, p, q - 1)
    quicksort(A, q + 1, r)

Sort a list by recursively partitionioning list until sorted.


def reverse_list(l):
    if l == []:
        return []
    return reverse_list(l[1:]) + [l[0]]

Recursively reverse a list of elements.


Recursively reverse a list of elements.


def selectionsort(A):
    i = 0
    while i < len(A):
        min_index = i
        j = i + 1
        while j < len(A):
            if A[j] < A[min_index]:
                min_index = j
            j += 1
        A[i], A[min_index] = A[min_index], A[i]
        i += 1

Sort a list by repeatedly move minimimum of remaining sublist to front.

assert selectionsort([])==None and selectionsort([])==None and selectionsort([0])==None and selectionsort([0])==None


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

Test if two circles overlap.


Test if two circles overlap.


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


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


def countdown(num):
    if num == 1:
        print(num)
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(0.1)
        countdown(num - 1)


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


def countdown(num):
    while num >= 1:
        print(num)
        time.sleep(0.1)
        num = num - 1
    print('LIFT OFF!')


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


def fibonacci(n):
    if n == 0:
        return 0
    elif 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


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


def countdown(num):
    if num == 0:
        print('LIFT OFF!')
    else:
        print(num)
        time.sleep(0.1)
        countdown(num - 1)


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


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


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 append2list(l1, l2=[]):
    l3 = []
    for i in l1:
        l3.append(i)
    return l3


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


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


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


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


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


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


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


_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

Test if two circles overlap.


def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):
    a = (x2 - x1) ** 2
    b = (y2 - y1) ** 2
    c = (a + b) ** 0.5
    total_r = r1 + r2
    if c < total_r:
        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 power(m, n):
    if not n:
        return 1
    return m * power(m, n - 1)


def minimum(l):
    if len(l) == 1:
        return l[0]
    tail_min = minimum(l[1:])
    return l[0] if l[0] < tail_min else tail_min


def maximum(l):
    if len(l) == 1:
        return l[0]
    tail_max = maximum(l[1:])
    return l[0] if l[0] > tail_max else tail_max


def count_letters(s):
    if not s:
        return 0
    return 1 + count_letters(s[1:])


def reverse_list(l):
    if l == []:
        return []
    return reverse_list(l[1:]) + [l[0]]

Recursively reverse a list of elements.


Recursively reverse a list of elements.


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


def partition(A, p, r):
    q = j = p
    while j < r:
        if A[j] <= A[r]:
            A[q], A[j] = A[j], A[q]
            q += 1
        j += 1
    A[q], A[r] = A[r], A[q]
    return q

def quicksort(A, p, r):
    if r <= p:
        return
    q = partition(A, p, r)
    quicksort(A, p, q - 1)
    quicksort(A, q + 1, r)


def selectionsort(A):
    i = 0
    while i < len(A):
        min_index = i
        j = i + 1
        while j < len(A):
            if A[j] < A[min_index]:
                min_index = j
            j += 1
        A[i], A[min_index] = A[min_index], A[i]
        i += 1


def selectionsort(a):
    i = 0
    while i < len(a):
        j = i + 1
        p = i
        while j < len(a):
            if a[j] < a[p]:
                p = j
            j += 1
        a[p], a[i] = a[i], a[p]
    i += 1
    return a


def power(n):
    if n == 0:
        return 0
    else:
        return n ** power(n - 1)


def power(m, n):
    if n == 0:
        return 0
    else:
        return m ** power(n - 1)


def selectionsort(a):
    i = 0
    while i < len(a):
        j = i + 1
        p = i
        while j < len(a):
            if a[j] < a[p]:
                p = j
            j += 1
        a[p], a[i] = a[i], a[p]
        i += 1
    return a


def power(m, n):
    if n == 0:
        return 0
    else:
        return n ** power(m - 1)


def power(m, n):
    if n == 0:
        return 1
    return m * power(m, n - 1)


def minimum(l):
    l = l.sort()
    return l[0]


def power(m, n):
    if n == 0:
        return 1
    if n == 1:
        return m
    if m == 0:
        return 0
    if m == 1:
        return 1
    return m * power(m, n - 1)


def minimum(l):
    l.sort()
    return l[0]


def minimum(l):
    A = 'null'
    lowest = A
    for c in l:
        if lowest == A:
            lowest = c
        elif c < lowest:
            lowest = c
    return lowest


def power(m, n):
    if n == 0:
        return 1
    if n == 1:
        return m
    if m == 0:
        return 0
    if m == 1:
        return 1
    return m ** n


def maximum(l):
    return l.sort()
    l[-1]


def maximum(l):
    l.sort()
    return l[-1]


def maximum(l):
    A = 'null'
    highest = A
    for c in l:
        if maximum == A:
            maximum = c
        elif c > maximum:
            maximum = c
    return maximum


def power(m, n):
    if m == 0:
        return 0
    elif m == 1:
        return 1
    elif n == 0:
        return 1
    elif n == 1:
        return m
    else:
        m * power(m, n - 1)


def maximum(l):
    A = 'null'
    highest = A
    for c in l:
        if highest == A:
            highest = c
        elif c > highest:
            highest = c
    return highest


def power(m, n):
    if m == 0:
        return 0
    elif m == 1:
        return 1
    elif n == 0:
        return 1
    elif n == 1:
        return m
    else:
        return m * power(m, n - 1)


def count_letters(s):
    str_len = 0
    for c in s:
        str_len += 1
    return str_len


def minimum(l):
    if len(l) == 1:
        return l[0]
    else:
        mini = minimum(l[1:])
    if l[0] < mini:
        return l[0]
    else:
        return mini


def minimum(a):
    tmp = a[0]
    for i in a:
        if i < tmp:
            tmp = i
    return tmp


def reverse_list(l):
    if l == []:
        return []
    temp = reverse_list(l[1:])
    temp.append(l[0])
    return temp

Recursively reverse a list of elements.


Recursively reverse a list of elements.


def maximum(a):
    tmp = a[0]
    for i in a:
        if i > tmp:
            tmp = i
    return tmp


def reverse_list(l):
    new_list = []
    for c in l:
        new_list.append(l.pop)
    return new_list

Recursively reverse a list of elements.


def maximum(l):
    if len(l) == 1:
        return l[0]
    else:
        maxi = maximum(l[1:])
    if l[0] > maxi:
        return l[0]
    else:
        return maxi


def minimum(l):
    if not l or len(l) == 1:
        return l
    tail_min = minimum(l[1:])
    return l[0] if l[0] < tail_min else tail_min


def reverse_list(l):
    new_list = []
    for c in l:
        new_list.append(l.pop())
    return new_list

Recursively reverse a list of elements.


def minimum(l):
    if not l:
        return l
    if len(l) == 1:
        return l[0]
    tail_min = minimum(l[1:])
    if tail_min == []:
        return l[0]
    return l[0] if l[0] < tail_min else tail_min


def minimum(l):
    if len(l) == 1:
        return l[0]
    mini = minimum(l[1:])
    if l[0] < mini:
        return l[0]
    else:
        return mini


def maximum(l):
    if not l:
        return l
    if len(l) == 1:
        return l[0]
    tail_max = maximum(l[1:])
    if tail_max == []:
        return l[0]
    return l[0] if l[0] > tail_max else tail_max


def maximum(l):
    if len(l) == 1:
        return l[0]
    maxi = maximum(l[1:])
    if l[0] > maxi:
        return l[0]
    else:
        return maxi


def power(m, n):
    if n == 0:
        return 1
    if n == 1:
        return m
    if m == 0:
        return 0
    if m == 1:
        return 1
    return m * power(m, n - 1)


def count_letters(string):
    if not string:
        return 0
    return count_letters(string[1:] + 1)


def reverse_list(l):
    new_list = []
    for c in l:
        new_list.append(l.pop())
    new_list.append(l.pop())
    return new_list

Recursively reverse a list of elements.


def minimum(l):
    if len(l) == 1:
        return l[0]
    elif minimum(l[0:len(l)]) < minimum(l[len(l) + 1:]):
        return minimum(l[0:len(l)])
    else:
        return minimum(l[len(l) + 1:])


def power(m, n):
    while n != 0:
        m *= m
        n -= 1
    return m


def reverse_list(l):
    new_list = []
    i = 0
    while len(l) > i:
        new_list.append(l.pop())
        i += 1
    return new_list

Recursively reverse a list of elements.


def minimum(l):
    if len(l) == 1:
        return l[0]
    else:
        mini = minimum(l[1:])
        if l[0] < mini:
            return l[0]
        else:
            return mini


def power(m, n):
    while n != 0:
        m = m * m
        n = n - 1
    return m


def minimum(l):
    if len(l) == 1:
        return l[0]
    smallest = minimum(l[1:])
    if l[0] < smallest:
        return l[0]
    else:
        return smallest


def power(m, n):
    while n > 0:
        m = m * m
        n = n - 1
    return m


def count_letters(string):
    if not string:
        return 0
    return count_letters(string[1:]) + 1


def power(m, n):
    if n == 0:
        return 1
    return m * power(m, n - 1)


def power(m, n, flag=True, m1=None):
    if not n:
        return 1
    if flag:
        m1 = m
    if n == 1:
        return m
    return power(m * m1, n - 1, False, m1)


def maximum(l):
    if len(l) == 1:
        return l[0]
    else:
        m = maximum(l[1:])
        if l[0] > m:
            return l[0]
        else:
            return m


def count_letters(s):
    if s == '':
        return 0
    else:
        return 1 + count_letters(s[1:])


def power(m, n):
    while n > 0:
        m = m * m
        n = n - 1
        print(n)
    return m


def minimum(l):
    if len(l) == 1:
        return l[0]
    smaller = minimum(l[1:])
    if l[0] < smaller:
        return l[0]
    return smaller


def count_letters(s):
    if len(s) == 1:
        return 1
    else:
        return 1 + count_letters(s[1:])


def count_letters(s):
    if len(s) == 0:
        return 0
    elif len(s) == 1:
        return 1
    else:
        return 1 + count_letters(s[1:])


def reverse_list(l):
    return l[-1] + reverse_list(l[:-1])

Recursively reverse a list of elements.


def reverse_list(l):
    if len(l) == 1:
        return l
    return l[-1] + reverse_list(l[:-1])

Recursively reverse a list of elements.


def maximum(l):
    if len(l) == 1:
        return l[0]
    smaller = maximum(l[1:])
    if l[0] > smaller:
        return l[0]
    return smaller


def reverse_list(l):
    if len(l) == 1:
        return l
    return l[-1].extend(reverse_list(l[:-1]))

Recursively reverse a list of elements.


def reverse_list(l):
    if len(l) == 0:
        return l
    return reverse_list(l[1:]) + [l[0]]

Recursively reverse a list of elements.


Recursively reverse a list of elements.


def power(m, n):
    m = m ** n
    return power(m, n)


def reverse_list(l):
    if len(l) == 1:
        return l
    return [l[-1]].extend(reverse_list(l[:-1]))

Recursively reverse a list of elements.


def maximum(l):
    if len(l) == 1:
        return l[0]
    biggest = maximum(l[1:])
    if l[0] > biggest:
        return l[0]
    else:
        return biggest


def maximum(l):
    if len(l) == 1:
        return l[0]
    bigger = maximum(l[1:])
    if l[0] > bigger:
        return l[0]
    return bigger


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


def selectionsort(a):
    return 'fuck my life and everything in between'


def reverse_list(l):
    if len(l) == 1:
        return l
    return [l[-1]] + reverse_list(l[:-1])

Recursively reverse a list of elements.


def maximum(lst):
    if len(lst) == 1:
        return lst[0]
    maxi = maximum(lst[1:])
    if lst[0] > maxi:
        return lst[0]
    else:
        return maxi


def minimum(lst):
    if len(lst) == 1:
        return lst[0]
    mini = minimum(lst[1:])
    if lst[0] < mini:
        return lst[0]
    else:
        return mini


def reverse_list(a):
    if a == []:
        return []
    temp = reverse_list(a[1:])
    temp.append(a[0])
    return temp

Recursively reverse a list of elements.


def power(m, n):
    if n == 0:
        return 1
    return m * power(m, n - 1)


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


def reverse_list(l):
    if len(l) == 1 or not l:
        return l
    return [l[-1]] + reverse_list(l[:-1])

Recursively reverse a list of elements.


def reverse_list(ls):
    return ls.reverse()

Recursively reverse a list of elements.


def power(m, n):
    if n == 0:
        return 0
    return m * power(m, n - 1)


def selectionsort(a):
    start = time.time()
    i = 0
    while i < len(a):
        j = i + 1
        p = i
        while j < len(a):
            if a[j] < a[p]:
                p = j
            j += 1
        a[p], a[i] = a[i], a[p]
        i += 1
    return a


def power(m, n):
    if m == m ** n:
        return m
    else:
        m = m ** n
        return power(m, n)


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


def power(m, n):
    if m == 1:
        return m
    else:
        m = m ** n
        return power(m, n)


def reverse_list(l):
    if len(l) == 1:
        return l
    else:
        return reverse_list(l[1:]).append(l[0])

Recursively reverse a list of elements.


def power(m, n):
    return m * power(m, n - 1)


def power(m, n):
    if n == 0:
        return m
    return m * power(m, n - 1)


def fibonacci(n):
    return n * fibonacci(n - 1)


def reverse_list(ls):
    ls.reverse()
    return ls

Recursively reverse a list of elements.


Recursively reverse a list of elements.


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


def reverse_list(l):
    if l == []:
        return []
    else:
        return [l[-1]] + reverse_list(l[:-1])

Recursively reverse a list of elements.


def minimum(l):
    smallest = l[0]
    for e in l:
        if e < smallest:
            smallest = e
    return smallest


def power(m, n):
    if m == 0:
        return 1
    else:
        m = m ** n
        return power(m - 1, n)


def count_letters(s):
    if s == '':
        return 0
    return 1 + count_letters(s[1:])


def power(m, n):
    if m == 0:
        return 1
    else:
        m = m ** n
        return n * power(m - 1, n)


def maximum(l):
    biggest = l[0]
    for e in l:
        if e < biggest:
            biggest = e
    return biggest


def reverse_list(a):
    if a == []:
        return []
    tmp = reverse_list(a[1:])
    tmp.append(a[0])
    return tmp

Recursively reverse a list of elements.


def maximum(l):
    biggest = l[0]
    for e in l:
        if e > biggest:
            biggest = e
    return biggest


def power(m, n):
    return power(m - 1, n)


def power(m, n):
    if n == 0:
        return 1
    return m * power(m, n - 1)


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


def reverse_list(l):
    if len(l) == 1:
        return list(l)
    else:
        return reverse_list(l[1:]).append(l[0])

Recursively reverse a list of elements.


def count_letters(s):
    if not s:
        return 0
    return 1 + count_letters(s[1:])


def reverse_list(l):
    if l == []:
        return []
    if len(l) == 1:
        return l
    else:
        return reverse_list(l[1:]).append(l[0])

Recursively reverse a list of elements.


def reverse_list(l):
    if not l:
        return []
    else:
        return reverse_list(l[1:]).append(l[0])

Recursively reverse a list of elements.


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


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


def minimum(a):
    m = a[0]
    for n in a:
        if n < m:
            n == m
    return m


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


def minimum(a):
    m = a[0]
    for n in a:
        if n < m:
            m = n
    return m


def maximum(a):
    m = a[0]
    for n in a:
        if n > m:
            m = n
    return m


def reverse_list(l):
    if not l:
        return l
    else:
        temp = reverse_list(l[1:])
        temp.append(l[0])
        return temp

Recursively reverse a list of elements.


Recursively reverse a list of elements.


def count_letters(s):
    i = 0
    for c in s:
        i += 1
    return i


def count_letters(s):
    if s == '':
        return 0
    return 1 + count_letters(s[:-1])


def count_letters(word):
    if not word:
        return 0
    return 1 + word[:-1]


def reverse_list(a):
    b = []
    for s in a:
        b.append(-1)
    return b

Recursively reverse a list of elements.


def count_letters(word):
    if not word:
        return 0
    return 1 + count_letters(word[:-1])


def reverse_list(a):
    b = []
    i = 0
    while i < len(a):
        b.append(a[-i - 1])
        i += 1
    return b

Recursively reverse a list of elements.


def swap(l, i, j):
    temp = l[i]
    l[i] = l[j]
    l[j] = temp

def quicksort(l, p, r):
    if r <= p:
        return l
    q = p
    for j in range(p, r):
        if l[j] <= l[r]:
            swap(l, j, q)
            q += 1
    swap(l, q, r)
    quicksort(l, p, q - 1)
    quicksort(l, q + 1, r)
    return l


def partition(A, p, r):
    q = j = p
    while j < r:
        if A[j] <= A[r]:
            A[q], A[j] = A[j], A[q]
            q += 1
        j += 1
    A[q], A[r] = A[r], A[q]
    return q

def quicksort(A, p, r):
    if r <= p:
        return A
    q = partition(A, p, r)
    quicksort(A, p, q - 1)
    quicksort(A, q + 1, r)


def fibonacci(n):
    a = 0
    b = 1
    while a < n:
        a += b
        a, b = b, a
        print(a)


def partition(A, p, r):
    q = j = p
    while j < r:
        if A[j] <= A[r]:
            A[q], A[j] = A[j], A[q]
            q += 1
        j += 1
    A[q], A[r] = A[r], A[q]
    return q

def quicksort(A, p, r):
    if r <= p:
        return
    q = partition(A, p, r)
    quicksort(A, p, q - 1)
    quicksort(A, q + 1, r)


def fibonacci(n):
    a = 0
    b = 1
    l = []
    while a < n:
        a += b
        a, b = b, a
        l.append(a)
    return l(len.l() - 1)


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


def partition(l, p, r):
    q = j = p
    while j < r:
        if l[j] <= l[r]:
            l[q], l[j] = l[j], l[q]
            q += 1
        j += 1
    l[q], l[r] = l[r], l[q]
    return q

def quicksort(l, p, r):
    if r <= p:
        return l
    q = partition(l, p, r)
    quicksort(l, p, q - 1)
    quicksort(l, q + 1, r)


def reverse_list(l):
    if not l:
        return []
    return reverse_list[0].append(reverse_list[1:])

Recursively reverse a list of elements.


def reverse_list(l):
    if not l:
        return []
    return reverse_list[0].append(reverse_list(l[1:]))

Recursively reverse a list of elements.


def reverse_list(l):
    if not l:
        return []
    return l[0].append(reverse_list(l[1:]))

Recursively reverse a list of elements.


def selectionsort(a):
    i = 0
    while i < len(a):
        p = i
        j = i + 1
        while j < len(a):
            if a[j] < a[p]:
                p = j
            j = j + 1
        tmp = a[p]
        a[p] = a[i]
        a[i] = tmp
        i += 1


def reverse_list(l):
    if not l:
        return []
    return [l[0]].append(reverse_list(l[1:]))

Recursively reverse a list of elements.


def fibonacci(n):
    a = 0
    b = 1
    l = []
    c = 0
    while c != n:
        a += b
        a, b = b, a
        l.append(a)
        c += 1
    return l[int(len(l) - 1)]


def selectionsort(a):
    i = 0
    while i < len(a):
        p = i
        j = i + 1
        while j < len(a):
            if a[j] < a[p]:
                p = j
            j = j + 1
        tmp = a[p]
        a[p] = a[i]
        a[i] = tmp
        i = i + 1


Recursively reverse a list of elements.


def reverse_list(a):
    if a == []:
        return a
    else:
        return reverse_list(a[1:]).append(a[0])

Recursively reverse a list of elements.


def power(m, n):
    if n == 0:
        return 1
    return m * power(m, n - 1)


def reverse_list(a):
    b = []
    i = 0
    while i < len(a):
        b.append(a[-i - 1])
        i += 1
    return b

Recursively reverse a list of elements.


def fibonacci(n):
    try:
        a = 0
        b = 1
        l = []
        c = 0
        while c != n:
            a += b
            a, b = b, a
            l.append(a)
            c += 1
        return l[int(len(l) - 1)]
    except:
        return 1


def selectionsort(l):
    N = len(l)
    p = 0
    j = 1
    while j < N:
        if l[j] < l[p]:
            p = j
        j += 1
    return p


def selectionsort(l):
    i = 0
    while i < len(l):
        p = i
        j = i + 1
        while j < len(l):
            if l[j] < l[p]:
                p = j
            j = j + 1
        tmp = l[p]
        l[p] = l[i]
        l[i] = tmp
        i = i + 1


def fibonacci(n):
    a = 0
    b = 1
    l = []
    c = 0
    while c != n:
        a += b
        a, b = b, a
        l.append(a)
        c += 1
    return l[-1]


def reverse_list(l):
    if not l or len(l) == 1:
        return l
    return [l[-1]] + reverse_list(l[:-1])

Recursively reverse a list of elements.


def partition(A, p, r):
    q = j = p
    while j < r:
        if A[j] <= A[r]:
            A[q], A[j] = A[j], A[q]
            q += 1
        j += 1
    A[q], A[r] = A[r], A[q]
    return q

def quicksort(A, p, r):
    if r <= p:
        return
    q = partition(A, p, r)
    quicksort(A, p, q - 1)
    quicksort(A, q + 1, r)


def partition(A, p, r):
    q = j = p
    while j < r:
        if A[j] <= A[r]:
            A[q], A[j] = A[j], A[q]
            q += 1
        j += 1
    A[q], A[r] = A[r], A[q]
    return q

def quicksort(A, p, r):
    if r <= p:
        return ()
    q = partition(A, p, r)
    quicksort(A, p, q - 1)
    quicksort(A, q + 1, r)


def fibonacci(n):
    if n == 0:
        return 1
    a = 0
    b = 1
    l = []
    c = 0
    while c != n:
        a += b
        a, b = b, a
        l.append(a)
        c += 1
    print(l)
    return l[-1]


def fibonacci(n):
    if n == 0:
        return 1
    a = 0
    b = 1
    l = []
    c = 0
    while c != n:
        a += b
        a, b = b, a
        l.append(a)
        c += 1
    return l[-1]


def minimum(n=[]):
    List = sorted(n)
    return List[0]


def maximum(n=[]):
    List = sorted(n)
    return List[-1]


def selectionsort(a):
    i = 0
    while i < len(a):
        p = i
        j = i + 1
        while j < len(a):
            if a[j] < a[p]:
                p = j
            j = j + 1
        a[i], a[p] = a[p], a[i]
    i = i + 1


def selectionsort(a):
    i = 0
    while i < len(a):
        p = i
        j = i + 1
        while j < len(a):
            if a[j] < a[p]:
                p = j
            j = j + 1
        tmp = a[p]
        a[p] = a[i]
        a[i] = tmp
    i = i + 1


def selectionsort(a):
    i = 0
    while i < len(a):
        p = i
        j = i + 1
        while j < len(a):
            if a[j] < a[p]:
                p = j
            j = j + 1
        tmp = a[p]
        a[p] = a[i]
        a[i] = tmp
        i = i + 1


def selectionsort(a):
    i = 0
    while i < len(a):
        p = i
        j = i + 1
        while j < len(a):
            if a[j] < a[p]:
                p = j
            j = j + 1
        a[i], a[p] = a[p], a[i]
        i = i + 1


def selectionsort(l):
    for i in range(1, len(l)):
        for j in range(i, 0, -1):
            if l[j] < l[j - 1]:
                temp = l[j]
                l[j] = l[j - 1]
                l[j - 1] = temp


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


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


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


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


def minimum(l):
    min = sum(l)
    for i in l:
        if i < min:
            min = i
    return min


def maximum(l):
    max = -1 * sum(l)
    for i in l:
        if i > max:
            max = i
    return max


def count_letters(s):
    count = 0
    for i in s:
        count += 1
    return count


Recursively reverse a list of elements.


def fibonacci(n):
    fibonacci = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55]
    return fibonacci[n]


def selectionsort(a):
    if len(a) != 2:
        a = [[], a]
    mini = min(a[1])
    a[1].remove(mini)
    a[0].append(mini)
    if len(a[1]) == 0:
        return a[0]
    else:
        return selectionsort(a)


def smallest(a, i):
    p = i
    j = i + 1
    while j < len(a):
        if a[j] < a[p]:
            p = j
        j += 1
    return p

def swap(a, i, p):
    tmp = a[p]
    a[p] = a[i]
    a[i] = tmp

def selectionsort(a):
    i = 0
    while i < len(a):
        p = smallest(a, i)
        swap(a, i, p)
        i += 1
    return a


def quicksort(a, n, b):
    a = sorted(a)


def selectionsort(A):
    for i in range(len(A)):
        mini = i
        for j in range(i, len(A)):
            if A[j] < A[mini]:
                mini = j
        A[i], A[mini] = A[mini], A[i]


def minimum(l):
    if len(l) == 1:
        return l[0]
    if l[0] < l[1]:
        l.remove(l[1])
    else:
        l.remove(l[0])
    return minimum(l)


def maximum(l):
    if len(l) == 1:
        return l[0]
    if l[0] > l[1]:
        l.remove(l[1])
    else:
        l.remove(l[1])
    return maximum(l)


def maximum(l):
    if len(l) == 1:
        return l[0]
    if l[0] > l[1]:
        l.remove(l[1])
    else:
        l.remove(l[0])
    return maximum(l)


def count_letters(word):
    total = 0
    for c in word:
        total += 1
    return total


def reverse_list(l):
    new = []
    i = 0
    while i < len(l):
        new.append(l[len(l) - i - 1])
    i += 1
    return new

Recursively reverse a list of elements.


def reverse_list(l):
    new = []
    i = 0
    while i < len(l):
        new.append(l[len(l) - i - 1])
        i += 1
    return new

Recursively reverse a list of elements.


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


def partition(A, p, r):
    q = j = p
    while j < r:
        if A[j] <= A[r]:
            A[q], A[j] = A[j], A[q]
            q += 1
        j += 1
    A[q], A[r] = A[r], A[q]
    return q

def quicksort(A, p, r):
    if r <= p:
        return
    q = partition(A, p, r)
    quicksort(A, p, q - 1)
    quicksort(A, q + 1, r)


def quicksort(A, start, end):
    if end - start < 1:
        return
    i = j = start
    while i <= end:
        if A[i] <= A[end]:
            A[i], A[j] = A[j], A[i]
            j += 1
        i += 1
    quicksort(A, start, j - 2)
    quicksort(A, j, end)


def selectionsort(A):
    for i in range(len(A)):
        min_j = i
        for j in range(i, len(A)):
            if A[j] < A[min_j]:
                min_j = j
        A[i], A[min_j] = A[min_j], A[i]


def power(n, p):
    if p == 0:
        return 1
    else:
        return power(n, p - 1) * n


def minimum(l):
    if len(l) == 1:
        return l[0]
    else:
        min_ret = minimum(l[1:])
        return l[0] if l[0] < min_ret else min_ret


def maximum(l):
    if len(l) == 1:
        return l[0]
    else:
        max_ret = maximum(l[1:])
        return l[0] if l[0] > max_ret else max_ret


def count_letters(s):
    if s == '':
        return 0
    else:
        return 1 + count_letters(s[1:])


def reverse_list(l):
    if len(l) == 0:
        return []
    else:
        return [l[-1]] + reverse_list(l[:-1])

Recursively reverse a list of elements.


Recursively reverse a list of elements.


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


def power(m, n):
    if n == 0:
        return 0
    return n ** m


def power(m, n):
    if n == 0:
        return 0
    return m ** n


def power(m, n):
    if n == 0:
        return 1
    return m ** n


def power(i, power):
    if i == i ** power:
        return i
    power(i * i, power)


def power(i, power):
    if i == i ** power:
        print(i)
        return i
    power(i * i, power)


def power(i, power):
    if i == i ** power:
        return i
    i *= i
    power(i, power)


def power(i, n):
    if i == i ** n:
        print(i)
        return i
    i *= i
    power(i, n)


def power(i, n):
    if n == 0:
        return 1
    else:
        return i * power(i, n - 1)


def minimum(numbers):
    count = 0
    for i in numbers:
        if i > count:
            count = i
    return count


def minimum(numbers):
    count = numbers[0]
    for i in numbers:
        if i < count:
            count = i
    return count


def power(m, n):
    if n == 0:
        return 1
    return m * power(m, n - 1)


def selectionsort(A):
    for i in range(len(A)):
        min_j = i
        for j in range(i, len(A)):
            if A[j] < A[min_j]:
                min_j = j
        A[i], A[min_j] = A[min_j], A[i]