For this Question: Given an integer N, find the sum of i*j for each pair (i, j) such that 1 <= i < j <= N.

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

Constraints
2 <= N <= 200000Output a single integer, the answer to the above problem.Sample Input
4

Sample Output
35

Explanation:
1*2 + 1*3 + 1*4 + 2*3 + 2*4 + 3*4 = 2 + 3 + 4 + 6 + 8 + 12 = 35

Sample Input
87

Sample Output
7215142, I have written this Solution Code: M = 1000000007
n = int(input())

ans = 0;

for i in range(1,n):
	result =  (((n-i)*(i+1+n))/2)%M
	ans = (ans + result*i)%M

print(int(ans)), In this Programming Language: Python, Now tell me if this Code is compilable or not?