def triangle_num_gen():
	length = 1

	while True:

		a = []
		for i in range(0, length):
			a.append(i)

		length += 1

		if sum(a) == 0:
			continue

		yield sum(a)

def find_divisors(number):
	a = [number]

	for div in range(1, (number/2) + 1):
		if (number % div) == 0:
			a.append(div)

	return a




gen = triangle_num_gen();
i = 0

while True:
	i += 1
	triangle_number = gen.next()

	if (triangle_number % 2) != 0:
		continue

	divisors        = find_divisors(triangle_number)

	print i, triangle_number, len(divisors)

	if len(divisors) > 500:
		break