functions

# number = 13
#
# if number % 2 == 0:
#     print(True)
# else:
#     print(False)


def iseven(number):
    if number % 2 == 0:
        return True
    else:
        return False


def text():
    print("Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. "
          "Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. "
          "Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. "
          "Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.")

def getter(n):
    # возвращает результат + прерывает функцию (break)
    return n * 2


def summ(num1, num2, num3=0):
    return num1 + num2 + num3

# print(summ(12, 13))


def sum_of_list(*args):
    return sum(args)

# print(sum_of_list(-15, 3, 5, 1, 10, 12, 58))

def sum_of_list(arg1, arg2, *args):
    return sum(args)

def isodd(number):
    for i in number:
        if i % 2 != 0:
            yield i

# print(*isodd([1, 2, 3, 4, 5, 6]))

# print(isodd([1, 2, 3, 4, 5, 6]))

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

# print(factorial(4))

number = 23214324

# def digital_root(n):
#     while n >= 9:
#         digits = []
#         for i in str(n):
#             digits.append(int(i))
#             n = sum(digits)
#     return n
#
# print(digital_root(1234567))

def digital_root(n):
    n = abs(n)
    while n > 9:
        n = sum(int(i) for i in str(n))
    return n

# print(digital_root(12345679))

def recursive_digital_root(n):
    if n < 10:
        return n
    return recursive_digital_root(sum(int(i) for i in str(n)))

# print(recursive_digital_root(12345679))