Dice Combinations

'''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:

1+1+1
1+2
2+1
3

Input
The only input line has an integer n.
Output
Print the number of ways modulo 10^9+7.
Constraints


Example
Input:
3

Output:
4



3
111
1 2 
2 1 



4 

sum of ;
1 : dp(i=4-1) : 12 21 111 3
2 : dp(i=4-2) : 11 2
3: dp(1) : 1
4 : 1



3 :
1 : dp(2) : 11 2
2 : dp(1) : :1
3 : dp(0) : 0


Tasks
A Dice CombinationsB Card game
Your submissions'''

import sys
input_d = sys.stdin.read().split()
n = int(input_d[0])
dicevals = [i for i in range(1,7)]
vals = [0]*(n+1) 

for i in range(n+1):
    if i == 0 :
        vals[i] = 1
    for k in range(min(i,7)):
        vals[i]+= vals[k] % (10^9+7)

print(vals[n])

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER