#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=2e6+5,mod=1e9+7;
ll fct[N],inv[N],invfct[N];
void init(){
    fct[0]=fct[1]=1;
	inv[1]=1;
	invfct[0]=invfct[1]=1;
	for(ll i=2;i<N;i++){
		fct[i]=i*fct[i-1]%mod;
		inv[i]=ll(mod-inv[mod%i])*(mod/i)%mod;
		invfct[i]=ll(inv[i])*invfct[i-1]%mod;
	}
}
inline ll ncr(ll n,ll r){
    if(n<0 || n-r<0)return 0;
    ll val = fct[n]*invfct[r];
    val%=mod;
    val = val*invfct[n-r];
    val%=mod;
    return val;
}
int main(){
    ios_base:: sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    init();
    ll r1,c1,r2,c2;cin>>r1>>c1>>r2>>c2;
    ll ans = 0;
    for(ll r=r1;r<=r2;r++){
        ll val = ncr(r+c2+1,r+1) - ncr(r+c1,r+1);
        val = val + mod;
        val%=mod;
        ans = ans + val;
        ans%=mod;
       // cout<<r<<" "<<val<<endl;
    }
    cout<<ans;
}


