# Concealed Square
# 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.

def square(n): return n**2

# def digits(n):
#     return [n] if n<10 else digits(n // 10)+[n % 10]
