Compute the least common multiple of all integers from 1 to n (n up to 10^8) and print it modulo 2^32.
Given a natural number nnn, write a program that computes the least common multiple of every natural number from 111 to nnn.
The first line contains nnn (2≤n≤1082 \le n \le 10^82≤n≤108).
Print the least common multiple of every natural number that is at least 111 and at most nnn. The answer can be very large, so print it modulo 2322^{32}232.