import math
from tqdm import tqdm


def sum_root_for(num):
    num = num * 2
    n   = int(math.sqrt(num))
    if n * (n + 1) == num:
        return n
    else:
        return None


def hanshin_num(seed):
    high = 33 * seed
    low  = 4 * seed
    digs = int(math.log10(low))+ 1
    num = high * 10 ** digs + low
    return num


for i in tqdm(range(1, 100000000)):
    han = hanshin_num(i)
    n   = sum_root_for(han)
    if n is not None:
        print(i, n, han)