Kaprekar Number Checker

This problem requires you to determine whether a given positive integer K is a Kaprekar Number. A number K is called a Kaprekar number if when you square it to obtain \(K^2\), and then split the square into two parts — the right part having exactly as many digits as K and the left part containing the remaining digits (or 0 if no digits remain) — the sum of these two parts is equal to K itself.

Formally, if \(K^2\) is represented as a string, let n be the number of digits in K, and define:

[ R = \text{rightmost } n \text{ digits of } K^2, \quad L = \text{the remaining left digits (considered as 0 if empty)} ]

Then, K is a Kaprekar number if and only if:

[ K = L + R ]

Your task is to implement a program that reads an integer K from standard input and outputs "True" if K is a Kaprekar number, and "False" otherwise.

inputFormat

The input consists of a single line containing a positive integer K (1 ≤ K ≤ 10⁸).

outputFormat

Output a single line with either "True" if K is a Kaprekar number or "False" if it is not.

## sample

9

True

</p>