Problem:
Score : 1400 points

Problem Statement

Snuke is having another barbeque party.

This time, he will make one serving of Skewer Meal.

He has a stock of N Skewer Meal Packs. The i-th Skewer Meal Pack contains one skewer, A_i pieces of beef and B_i pieces of green pepper.
All skewers in these packs are different and distinguishable, while all pieces of beef and all pieces of green pepper are, respectively, indistinguishable.

To make a Skewer Meal, he chooses two of his Skewer Meal Packs, and takes out all of the contents from the chosen packs, that is, two skewers and some pieces of beef or green pepper.
(Remaining Skewer Meal Packs will not be used.)
Then, all those pieces of food are threaded onto both skewers, one by one, in any order.

(See the image in the Sample section for better understanding.)

In how many different ways can he make a Skewer Meal? Two ways of making a Skewer Meal is different if and only if the sets of the used skewers are different, or the orders of the pieces of food are different.
Since this number can be extremely large, find it modulo 10^9+7.

Constraints

2≦N≦200,000

1≦A_i≦2000, 1≦B_i≦2000

Input

The input is given from Standard Input in the following format:

N
A_1 B_1
A_2 B_2
:
A_N B_N

Output

Print the number of the different ways Snuke can make a serving of Skewer Meal, modulo 10^9+7.

Sample Input 1

3
1 1
1 1
2 1

Sample Output 1

26

The 26 ways of making a Skewer Meal are shown below.
Gray bars represent skewers, each with a number denoting the Skewer Meal Set that contained the skewer.
Brown and green rectangles represent pieces of beef and green pepper, respectively.

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <cstdio>
#include <algorithm>
using namespace std;

typedef long long LL;

const int N = 1e5 + 10, M = 2010;
const LL mod = 1e9 + 7;

LL power(LL a, LL b)
{
	LL c = 1;
	for (; b; a = a * a % mod, b >>= 1)
		if (b & 1) c = c * a % mod;
	return c;
}

LL fac[M << 2], inv[M << 2];

void init(int n)
{
	fac[0] = 1;
	for (int i = 1; i <= n; ++ i)
		fac[i] = fac[i - 1] * i % mod;
	inv[n] = power(fac[n], mod - 2);
	for (int i = n - 1; i >= 0; -- i)
		inv[i] = inv[i + 1] * (i + 1) % mod;
}

LL C(int n, int m) { return fac[n] * inv[m] % mod * inv[n - m] % mod; }

int n;
int a[N], b[N], maxa, maxb;

LL f[M << 1][M << 1];

int main()
{
	scanf("%d", &n);
	for (int i = 1; i <= n; ++ i)
	{
		scanf("%d %d", &a[i], &b[i]);
		maxa = max(maxa, a[i]);
		maxb = max(maxb, b[i]);
	}
	++ maxa, ++ maxb;
	init(maxa + maxb << 1);
	for (int i = 1; i <= n; ++ i)
		++ f[maxa - a[i]][maxb - b[i]];
	for (int i = 1; i <= maxa << 1; ++ i)
		for (int j = 1; j <= maxb << 1; ++ j)
			(f[i][j] += f[i - 1][j] + f[i][j - 1]) %= mod;
	LL ans = 0;
	for (int i = 1; i <= n; ++ i)
		(ans += f[maxa + a[i]][maxb + b[i]]) %= mod;
	for (int i = 1; i <= n; ++ i)
		(ans += mod - C(a[i] + b[i] << 1, a[i] << 1)) %= mod;
	printf("%lld\n", ans * power(2, mod - 2) % mod);
}