oddNumber  = 1
aCount  = 0
dSum  = 0

from math import sqrt

def divisorSum(n):
    sum = 1
    i = int(sqrt(n)+1)

    for d in range (2, i):
        if n% d == 0:
            sum += d
            otherD = n 
            if otherD != d:
                sum += otherD
    return sum

print ()
while aCount  < 25:
    dSum  = divisorSum(oddNumber )
    if dSum  > oddNumber:
        aCount  += 1
        print(. format(oddNumber ,dSum ))
    oddNumber  += 2

while aCount  < 1000:
    dSum  = divisorSum(oddNumber )
    if dSum  > oddNumber:
        aCount  += 1
    oddNumber  += 2
print ()
print (,(oddNumber - 2),,dSum)

oddNumber  = 1000000001
found  = False
while not found:
    dSum  = divisorSum(oddNumber )
    if dSum  > oddNumber:
        found  = True
        print ()
        print (,oddNumber,,dSum)
    oddNumber  += 2