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: import java.io.*;
import java.util.*;



class Main {

public static void main (String[] args)throws IOException  {
BufferedReader bf=new BufferedReader(new InputStreamReader(System.in));
long n=Long.parseLong(bf.readLine());
long div=1000000007;
long totalSum=(n)*((n)+1)/2;
long sum=0;
for(long i=1;i<n;i++)
{
totalSum = totalSum - i;
sum = (sum + (totalSum*i))%div;
}
System.out.println(sum);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?