Multiply Sums :
Difficulty Level : Easy
Submissions : 598
Asked In :
Marks :10
: 2 | : 2
We are given an array which contains integers in ascending order followed by integers in descending order.
All the integers in the array are unique and do not occur multiple times.
Can you find out the product of the sum of values in ascending part and descending part modulo $$$10^9+7$$$.
Input
First line contains a single integer corresponding to integer N.
Second line contains N space separated integers corresponding to the values in the given array.
Constraints
$$$ 3 \le N \le 100000 $$$
$$$ 1 \le arr[i] , X \le 10^9 $$$
Output
A single integer corresponding to the product of sum of ascending and descending parts of the array.
Example
Input
7 3 8 14 12 10 7 4
Output
1175
