Given are N integers A_1,\ldots,A_N.

Find the sum of A_i \times A_j over all pairs (i,j) such that 1\leq i < j \leq N, modulo (10^9+7).

Constraints

* 2 \leq N \leq 2\times 10^5
* 0 \leq A_i \leq 10^9
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
A_1 \ldots A_N


Output

Print \sum_{i=1}^{N-1}\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).

Examples

Input

3
1 2 3


Output

11


Input

4
141421356 17320508 22360679 244949


Output

437235829

import java.math.BigInteger;
import java.util.*;

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		long array[];
		array = new long[n];
		for (int i = 0; i < n; i++) {
			array[i] = Long.parseLong(sc.next());
		}

		BigInteger sum = BigInteger.ZERO;
		BigInteger tate = BigInteger.ZERO;
		BigInteger yoko = BigInteger.ZERO;
		for (int i = 0; i < n - 1; i++) {
			tate = tate.add(BigInteger.valueOf(array[i]));
			yoko = BigInteger.valueOf(array[i + 1]);
			sum = sum.add(tate.multiply(yoko));
		}

		sum = sum.remainder(BigInteger.valueOf(1000000007));

		System.out.println(sum);

	}
}
