#include<bits/stdc++.h>
#define fo(i,a,b) for(int i=(a);i<=(b);++i)
#define rv(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int M = 2200000;
const int md=1e9+7;
typedef long long ll;
int n,m,k;
int fac[M],inv[M];
void ini(){
    inv[0] = inv[1] = 1;
    fac[0] = fac[1] = 1;
    fo(i,2,M-1) {
        inv[i] = 1ll*(md-md/i)*inv[md%i]%md;
    }
    fo(i,2,M-1) {
        inv[i] = 1ll*inv[i-1]*inv[i]%md;
        fac[i] = 1ll*fac[i-1]*i%md;
    }
}
ll C(int a,int b) {
    if(b<0 || a<b) return 0;
    return 1ll*fac[a]*inv[a-b]%md*inv[b]%md;
}
ll f(int a,int b) {
    return C(a+b,a);
}
int main(){
    ini();
    int r1,r2,c1,c2;
    cin>>r1>>c1>>r2>>c2;
    ll ans=f(r1,c1);
    fo(i,r1+1,r2)
        ans=(ans+f(i,c2))%md;
    fo(i,c1+1,c2)
        ans=(ans+f(r2,i))%md;
    cout<<ans<<endl;
    return 0;
}