Distinct Integer Products from Symbols

You are given a single integer n which represents the number of symbols chosen from the set \(\{A, B, C, D\}\). Each symbol is mapped to a prime number as follows:

• \(A \to 2\)
• \(B \to 3\)
• \(C \to 5\)
• \(D \to 7\)

Using exactly n symbols, you form an integer by multiplying the prime numbers corresponding to the selected symbols. Note that the order of symbols does not matter; that is, the multiset of symbols is considered, and two selections that differ only by order yield the same product.

Your task is to determine the number of distinct integers obtainable in this way.

inputFormat

The input consists of a single integer n (n \(\geq 1\)) on standard input.

outputFormat

Output a single integer which is the number of distinct products that can be obtained using exactly n symbols.

1

4