Aarav has just graduated from the university. Now he is going to travel along his country. More precisely: there are N cities with integer coordinates. His plan is to travel between each pair of the cities. 

The distance between city A with coordinates (x1, y1) and city B with coordinates (x2, y2) is equal to |x1 - x2| + |y1 - y2|.

Now he is interested in the total distance between all the pairs of the cities.

Input
The first line contains one integer N.
The following N lines contain two separated integers (xi, yi) each - coordinates of the corresponding city.

Output
Output one integer - the answer to the question. 
As this number can be very big - output it modulo 10^9 + 7.

Constraints
1 ≤ N ≤ 200 000
|xi|, |yi| ≤ 10^9

SAMPLE INPUT
4
-1 5
1 6
3 5
2 3

SAMPLE OUTPUT
22
sum=0
q=1000000007
n = int(raw_input())
a1 = []
a2 = []
for i in range(n):
	n1,n2 = raw_input().split()
	a1.append(int(n1))
	a2.append(int(n2))
   
a1.sort()
a2.sort()
   
for i in range(n-1,-1,-1):
  	sum=(sum+(n-1-2*(n-1-i))*a1[i])%q;
  	sum=(sum+(n-1-2*(n-1-i))*a2[i])%q;

print (sum)%q