#include<iostream>
#include<queue>
#include<cmath>
#include<cstdio>
#include<cstring>
#define INF 0x3f3f3f3f
#define LL long long
using namespace std;
int const maxn = 2e6+100;
int const mod = 1e9+7;
LL fac[maxn];
LL qpow(LL a, LL b){
	LL ans = 1;
    while (b) {
        if (b & 1)
            ans = ans * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ans;
}
LL C(LL n, LL m){
	return fac[n] * qpow(fac[m], mod-2) % mod * qpow(fac[n-m], mod-2) % mod;
}
int main(){
	fac[0] = fac[1] = 1;
	for(int i = 2; i < maxn; i++)
		fac[i] = fac[i-1] * i % mod;
	LL r1, r2, c1, c2;
	scanf("%lld %lld %lld %lld", &r1, &c1, &r2, &c2);
	LL res=C(r2+c2+2, c2+1) + C(r1+c1, c1) - C(r2+c1+1, c1) - C(r1+c2+1, c2+1);
	res = (res % mod + mod) % mod;
	printf("%lld\n", res%mod);
	return 0;
}