# Задание №1
from operator import delitem


def f1(mas):
    return sum([x for x in mas])

print(f1([1, 7, 42, 12, 10, 1, 4, 0])) # 77


# Задание №2

def f2(num, start, end):
    return num in range(start, end+1)

print(f2(7, 1, 9)) # True


# Задание №3

def f3(num):
    divisors = [1]
    for i in range(2, int(num**0.5)+1):
        if num % i == 0:
            divisors.append(i)
            divisors_dop = num // i
            if divisors_dop != i:
                divisors.append(divisors_dop)
    return sum(divisors) == num

print(f3(8128)) # True


# Задание №4

def f4(num):
    palindrome = str(num)
    length = len(palindrome)
    for i in range(length//2):
        if palindrome[i] != palindrome[length-1-i]:
            return False
    return True

print(f4(1234567899876554321)) # False


# Задание №5

def f5(num):
    divisors = []
    for i in range(1, int(num**0.5)+1):
        if num % i == 0:
            divisors.append(i)
            divisors_dop = num // i
            if divisors_dop != i:
                divisors.append(divisors_dop)
    return len(divisors) == 2


print(f5(123321)) # False

# Задание №6

def f6(n):
    if n == 1: return 0
    elif (n == 2) or (n == 3): return 1
    return f6(n-1) + f6(n-2)

print(f6(10)) # 34