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
N = int(raw_input())
x = []
y = []
distx = [0]*N
disty = [0]*N
mod =  1000000007
for i in xrange(0,N):
	a,b = map(int,raw_input().split(" "))
	x.append(a)
	y.append(b)
x = sorted(x)
y = sorted(y)

ans = 0

for i in xrange(1,N):
	distx[i] = (distx[i-1]+((x[i]-x[i-1])*i)%mod)%mod
	ans = (ans+distx[i]) %mod
	
for i in xrange(1,N):
	disty[i] = (disty[i-1]+((y[i]-y[i-1])*i)%mod)%mod
	ans = (ans+disty[i])%mod
print ans