#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define maxn 1000
using namespace std;
int n,A[100005],B[100005],C[100005],D[100005];
int F[2005][2005],ans;

ll read(){
    ll x=0,w=0;char ch=getchar();
    while(!isdigit(ch)) w|=(ch=='-'),ch=getchar();
    while(isdigit(ch)) x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
    return w?-x:x;
}

void print(ll x){
	if(x>=10) print(x/10);
	putchar(x%10+'0');
}

int main(){
	n=read();
	for(int i=1;i<=n;i++){
		A[i]=read(),B[i]=read(),C[i]=read(),D[i]=read();
		F[maxn-A[i]][maxn-C[i]]++;
	}
	for(int i=0;i<=2*maxn;i++){
		for(int j=0;j<=2*maxn;j++){
			if(i) (F[i][j]+=F[i-1][j])%=mod;
			if(j) (F[i][j]+=F[i][j-1])%=mod;
		}
	}
	for(int i=1;i<=n;i++) (ans+=F[maxn+B[i]][maxn+D[i]])%=mod;
	print(ans),puts("");
	
	return 0;
}