text_plain_output_3.png text_plain_output_2.png text_plain_output_1.png
def max_digit(n, d, r):
    max_number = -1
    n = abs(n)
    while n > 0:
        digit = n % 10
        if digit % d == r:
            if digit > max_number:
                max_number = digit
        n //= 10
    return max_number
def main():
    n = int(input())
    d = int(input())
    r = int(input())
main()

def binom(n, k):
    res = 1
    if n < 0 or k < 0:
        return 0
    else:
        for i in range(1, n + 1):
            res *= i
        for m in range(1, k + 1):
            res /= m
        for n in range(1, n - k + 1):
            res /= n
        return int(res)
def binomf(n, k):
    res = 1
    if n < 0 or k < 0:
        return 0
    else:
        for i in range(1, n + 1):
            res *= i
        for m in range(1, k + 1):
            res = float(res / m)
        for n in range(1, n - k + 1):
            res = float(res / n)
        return res
def main():
    n = int(input())
    k = int(input())
main()

def prime(n):
    for i in range(2, n):
        if n % i == 0:
            return False
        else:
            return True
def main():
    continue_or_not = True
    while continue_or_not:
        n = int(input())
        if n <= 0:
            continue_or_not = False
main()

def rich(n):
    total_divisors = 0
    for i in range(1, n):
        if n % i == 0:
            total_divisors += i
    if total_divisors > n:
        print(n)
        return True
    else:
        return False
def main():
    k = abs(int(input('Enter a integer: ')))
    for n in range(1, k):
        print(rich(n))
main()