Dice Combinations

def main():
    n = int(input())
    memo = {}

    def recursion(integer):
        
        if integer == 0:
            return 1

        if integer < 0:
            return 0

        if integer in memo:
            return memo[integer]

        count = 0

        for i in range(1, 7):
            count += recursion(integer - i)

        memo[integer] = count
        return count

    print(recursion(n))


main()

#memo[1] = 1
#memo[2] = 2
#memo[3] = 4
#memo[4] = 

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: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 27, in <module>
    m...

Test 14

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 27, in <module>
    m...

Test 15

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 27, in <module>
    m...

Test 16

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 27, in <module>
    m...

Test 17

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 27, in <module>
    m...

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 27, in <module>
    m...

Test 20

Verdict: WRONG ANSWER