Sum of Digits Prime Check

Given an integer N, compute the sum of its digits and determine whether the result is a prime number. Let \(S = d_1 + d_2 + \cdots + d_k\) be the sum of the digits of N. A prime number is defined as an integer greater than 1 that has no divisors other than 1 and itself.

Your task is to output True if \(S\) is prime and False otherwise.

inputFormat

The input consists of a single line containing an integer N provided via standard input.

outputFormat

Output a single line: True if the sum of the digits of N is a prime number, otherwise False.

47

True