1860. Fiborial @ Timus Online Judge

Online Judge	Problems	Authors	Online contests
About Online Judge Frequently asked questions Site news Webboard Links	Problem set Submit solution Judge status Guide	Register Update your info Authors ranklist	Current contest Scheduled contests Past contests Rules

1860. Fiborial

Time limit: 0.5 second
Memory limit: 64 MB

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⁶).

Output

Output the answer modulo 10⁹ + 7.

Sample

input	output
3	4

Problem Author: Denis Dublennykh (idea by Grigoriy Nazarov)
Problem Source: Ural SU Team.GOV Contest. Petrozavodsk Summer Session, August 2011

Tags: none ()

Difficulty: 459 Printable version Submit solution Discussion (5)
All submissions (4224) All accepted submissions (1174) Solutions rating (700)