poj 3910

nput



The input file contains several test cases. Each test case starts with an integer n (0 < n < 1000), that stands for the cardinality of S. The next line contains the numbers of S: x1, x2, ..., xn. It is known that each xi is an integer, 0 < xi < 2*109. The input data set is correct and ends with an end of file.

Output



For each test case find and print the value Dn mod 1000000007.

Sample Input



2

1 2

3

1 3 9

4

1 2 3 6-poj 3910 nput The input file contains several test cases. Each test case starts with an integer n (0 < n < 1000), that stands for the cardinality of S. The next line contains the numbers of S: x1, x2, .. ., xn. It is known that each xi is an integer, 0 < xi < 2* 109. The input data set is correct and ends with an end of file. Output For each test case find and print the value Dn mod 1000000007. Sample Input 2 1 2 3 1 3 9 4 1 2 3 6