题号:NC51063
时间限制:C/C++/Rust/Pascal 2秒,其他语言4秒
空间限制:C/C++/Rust/Pascal 512 M,其他语言1024 M
64bit IO Format: %lld
题目描述
Bobo knows that
Given n distinct positive integers

, find the value of
It can be proved that the value is a rational number

.
Print the result as
%20%5Cbmod%20(10%5E9%2B7))
.
输入描述:
The input consists of several test cases and is terminated by end-of-file.
The first line of each test case contains an integer n.
The second line contains n integers
.
* 
* 
*
are distinct.
* The sum of
does not exceed
.
输出描述:
For each test case, print an integer which denotes the result.
示例1
输出
复制
500000004
250000002
83333334