#C6023. Sum of Factorial Digits

    ID: 49738 Type: Default 1000ms 256MiB

Sum of Factorial Digits

Sum of Factorial Digits

Given a positive integer \( n \), compute the sum of the digits of \( n! \) (n factorial). The factorial of \( n \) is defined by \( n! = 1 \times 2 \times \cdots \times n \) with \( 0! = 1 \).

Input: A single integer \( n \) read from stdin.

Output: Print the sum of the digits of \( n! \) to stdout.

For example, when \( n = 5 \), since \( 5! = 120 \) and the sum of its digits is \( 1 + 2 + 0 = 3 \), the output would be 3.

inputFormat

The input consists of a single integer \( n \) (where \( 1 \leq n \leq 100 \)) provided via standard input.

outputFormat

The output is a single integer representing the sum of the digits of \( n! \), printed to standard output.

## sample
5
3

</p>