Prime-Friendly Street

A street number is said to be prime-friendly if the sum of its digits is a prime number. For example, consider the number \(23\): the sum of its digits is \(2 + 3 = 5\), and since \(5\) is a prime number, \(23\) is prime-friendly.

Your task is to determine whether a given street number is prime-friendly. If it is, output True; otherwise, output False.

inputFormat

The input is provided via standard input (stdin). It consists of a single integer \(N\), representing the street number.

outputFormat

Output a single line to standard output (stdout) with either True if the sum of the digits of \(N\) is a prime number, or False otherwise.

23

True