Divisors#4680

Divisors

1 second

128 megabytes

Easy

Given a positive integer $n$ . Find the number of positive divisors for $n!$ (factorial of the number $n$ ).

For example, if $n = 4$ n = 4, then $n! = 4 \times 3 \times 2 \times 1 = 24$ n! = 4 \times 3 \times 2 \times 1 = 24. This number has the following divisors: $1$ , $2$ , $3$ , $4$ , $6$ , $8$ , $12$ , $24$ . Thus, the desired amount of divisors equals to $8$ .

Input

One integer $n$ ( $1 \leq n \leq 45$ 1 \le n \le 45).

Output

Print the number of divisors for $n!$

Examples

Example 1

Loading

n = 4

n! = 4 \times 3 \times 2 \times 1 = 24

1 \leq n \leq 45