Consider a sequence Fi that satisfies the following conditions:
Find the number of different divisors of Fn.
Input file contains the only integer number n (1 ≤ n ≤ 106).
Output the answer modulo 109 + 7.
Problem Author: Denis Dublennykh (idea by Grigoriy Nazarov)
Problem Source: Ural SU Team.GOV Contest. Petrozavodsk Summer Session, August 2011