For this Question: Given an integer N, find the number of distinct arrays A, such that the sum of integers in the array is N and each integer in the array is greater than or equal to 3.

As the answer can be large, output it modulo 10<sup>9</sup>+7.The first and the only line of input contains an integer N.

Constraints
1 <= N <= 1000Output a single integer, the number of arrays modulo 1000000007.Sample Input
8

Sample Output
4

Explanation:
Following are the possible arrays: [3, 5], [4, 4], [5, 3], [8].

Sample Input
2

Sample Output 
0, I have written this Solution Code: n = int(input())
memoArray = [0]*(n+1)

def findWays(n):
	memoArray[3], memoArray[4], memoArray [5] = 1,1,1
	for i in range(6,n+1):
		memoArray[i] = (memoArray[i-1]+memoArray[i-3])%1000000007
	return memoArray[n]

if n<3:
	print(0)
elif n==3 or n == 4:
	print(1)
else:
	print(findWays(n)), In this Programming Language: Python, Now tell me if this Code is compilable or not?