Happy Number Checker

Given a positive integer \( n \), determine whether the number is a happy number.

A happy number is defined by the following process: starting with \( n \), replace the number with the sum of the squares of its digits. Repeat the process until \( n \) either equals \( 1 \) (where it will remain), or it enters an endless cycle that does not include \( 1 \). If the process ends in \( 1 \), the number is happy; otherwise, it is not.

Your task is to implement a program that reads an integer from standard input and prints True if the number is happy, or False otherwise.

inputFormat

The input consists of a single positive integer \( n \), provided via standard input.

outputFormat

Output True if the number \( n \) is happy, otherwise output False. The output should be printed to standard output.

19

True