Dice Combinations

n = int(input())
mod = 1000*1000*1000+7
list = list(range(0,n+1))
def func(n: int):
    global list
    if n < 0: return 0
    if n <= 1: return 1
    if list[n] != n: return list[n]
    result = 0
    for i in range(1,min(n,6)+1):
        result += func(n-i)%(mod)
    list[n] = result
    return result%mod
print(func(n))

#1 1 1 1
#1 2 1
#1 1 2
#1 3
#2 1 1
#2 2
#3 1
#4


#1 1 1 1 1
#1 1 2 1
#1 1 1 2
#1 1 3
#1 2 1 1
#1 2 2
#1 3 1
#1 4
#2 1 1 1
#2 1 2
#2 1 2
#2 3
#3 1 1
#3 2
#4 1
#5

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

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 14, in <module>
    print(func(n))
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  [Previous line repeated 1685 more times]
  File "/box/input/code.py", line 10, in func
    for i in range(1,min(n,6)+1):
RecursionError: maximum recursion depth exceeded

Test 14

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 14, in <module>
    print(func(n))
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  [Previous line repeated 1685 more times]
  File "/box/input/code.py", line 10, in func
    for i in range(1,min(n,6)+1):
RecursionError: maximum recursion depth exceeded

Test 15

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 14, in <module>
    print(func(n))
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  [Previous line repeated 1685 more times]
  File "/box/input/code.py", line 10, in func
    for i in range(1,min(n,6)+1):
RecursionError: maximum recursion depth exceeded

Test 16

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 14, in <module>
    print(func(n))
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  [Previous line repeated 1685 more times]
  File "/box/input/code.py", line 10, in func
    for i in range(1,min(n,6)+1):
RecursionError: maximum recursion depth exceeded

Test 17

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 14, in <module>
    print(func(n))
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  [Previous line repeated 1685 more times]
  File "/box/input/code.py", line 10, in func
    for i in range(1,min(n,6)+1):
RecursionError: maximum recursion depth exceeded

Test 18

Verdict: ACCEPTED

Test 19

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 14, in <module>
    print(func(n))
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  File "/box/input/code.py", line 11, in func
    result += func(n-i)%(mod)
  [Previous line repeated 1685 more times]
  File "/box/input/code.py", line 10, in func
    for i in range(1,min(n,6)+1):
RecursionError: maximum recursion depth exceeded

Test 20

Verdict: ACCEPTED