Description

One day, on the way to school, szb met Grey Wolf.

Grey Wolf: If you solve this problem for us, we will let you go.
szb: What problem?
Grey Wolf: Find the smallest number that is divisible by every number in $[1,n]$, and take it modulo $100000007$.
szb: This is too easy. I will have my little brother do it.

Then you proudly accepted this task.

Input Format

One line with one number $n$.

Output Format

One line with one number $ans$.

10

2520

Hint

$n \le 10^8$.

Translated by ChatGPT 5