Battlefields#1889
Petryk's game features battles between rival armies on rectangular fields divided into square cells. Such fields are common in many games, but Petryk's idea is that each battlefield must have a precise number of cells. Each subsequent battle takes place on a field containing one more cell than the previous one. The length and width of the fields do not matter and can be chosen arbitrarily. However, Petryk considers fields of size 1 \times k too simple and does not want them used in his game.
It is known that there will be battles in the game. Help Petryk choose the number of cells in the very first field so that for this and all next N-1 numbers of cells, it is possible to form at least one non-simple field.
The input contains a single integer (1 \leq N \leq 10000).
Print a single integer — the number of cells in the first of consecutive non-simple fields. This number does not have to be minimal, but it must not exceed 10^{4500}. If no such number exists, print .
Example 1