# Solution of;
# Project Euler Problem 206: Concealed Square
# https://projecteuler.net/problem=206
# 
# Find the unique positive integer whose square has the form 
# 1_2_3_4_5_6_7_8_9_0, where each “_” is a single digit.
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


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