# Solution of;
# Project Euler Problem 142: Perfect Square Collection
# https://projecteuler.net/problem=142
# 
# Find the smallest x + y + z with integers x > y > z > 0 such that x + y, x − 
# y, x + z, x − z, y + z, y − z are all perfect squares.
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


if __name__ == '__main__':
    n = 1000
    i = 10000
    prob_id = 142
    timed.caller(dummy, n, i, prob_id)
