Points: 1100 (p) Time limit: 1.0s Memory limit: 512M Input: stdin Output: stdout
Your task is to count the number of ways to construct sum n by throwing a dice one or more times. Each throw produces an outcome between 1 and 6.
For example, if n=3, there are 4 ways:
- The only input line has an integer n.
- Print the number of ways modulo 10^9+7.
- 1 \le n \le 10^6