Consider a sequence *F*_{i} that satisfies the following conditions:

Find the number of different divisors of *F*_{n}.

### Input

Input file contains the only integer number *n* (1 ≤ *n* ≤ 10^{6}).

### Output

Output the answer modulo 10^{9} + 7.

### Sample

**Problem Author: **Denis Dublennykh (idea by Grigoriy Nazarov)

**Problem Source: **Ural SU Team.GOV Contest. Petrozavodsk Summer Session, August 2011