#C1240. Vanishing Number
Vanishing Number
Vanishing Number
A vanishing number is defined as a number that eventually becomes 1 after repeatedly replacing the number by the sum of the squares of its digits. In mathematical terms, given a number \( n \), define the function \( f(n)=\sum_{i} d_i^2 \) where \( d_i \) are the digits of \( n \). If repeated application of \( f \) eventually leads to 1, then \( n \) is considered a vanishing number. Otherwise, if the process enters a cycle that does not include 1, the number is not vanishing.
Your task is to determine if the given integer is a vanishing number.
inputFormat
The input consists of a single line containing one integer \( n \) (where \( n \geq 0 \)).
outputFormat
Output a single line: True
if \( n \) is a vanishing number, otherwise False
.
19
True
</p>