Consider an $$n$$-digit positive integer $$k$$. Compute its square $$k^2$$ and subdivide it into two groups of digits: the $$n$$ digits on the right and the remaining digits on the left. If the sum of both these integers equals $$k$$ and if $$k^2$$ has at least two digits, the integer $$k$$ is called a Kaprekar number. For example, $$9$$ is a Kaprekar number since $$9^2 = 81$$ and $$8 + 1 = 9$$, and $$297$$ is a Kaprekar number since $$297^2 = 88209$$ and $$88 + 209 = 297$$.

Assignment

Write a function isKaprekar that takes a positive integer as an argument. The function must return as its result the value True if the given integer is a Kaprekar number. Otherwise the function must return the value False.

Example

>>> isKaprekar(9)
True
>>> isKaprekar(297)
True
>>> isKaprekar(12)
False
>>> isKaprekar(-33)
False
>>> isKaprekar(4950)
True