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().strip())
x = []
y = []
sum_x = sum_y = sum_n = 0
for n in range(N):
	[x1,y1] = [int(i) for i in raw_input().strip().split()]
	x.append(x1)
	y.append(y1)
x.sort();y.sort()	
sum_x = sum(x);sum_y=sum(y)
for i in range(N):
    sum_x -= x[i]
    sum_y -= y[i]
    sum_n += sum_x - (N-i-1)*x[i] + sum_y - (N-i-1)*y[i]
print sum_n%1000000007;