//
//  main.cpp
//

#include <algorithm>
#include <array>
#include <assert.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

using ll = int64_t;
using ull = uint64_t;
constexpr ll LL_MAX = numeric_limits<ll>::max();
constexpr ull ULL_MAX = numeric_limits<ull>::max();

template<typename T>
vector<T> make_vec_nd(T init, ll size) {
    return vector<T>(size, init);
}
template<typename T, typename... Args>
auto make_vec_nd(T init, ll size, Args... rest) {
    auto inner = make_vec_nd(init, rest...);
    return vector<decltype(inner)>(size, inner);
}

#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrep(i, a, b) for (ll i = (a)-1; i >= (b); i--)

struct Mod {
    static ll gcd(ll x, ll y, ll* out_cx, ll* out_cy) {
        if (x < 0) {
            ll d = gcd(-x, y, out_cx, out_cy);
            if (out_cx) {
                *out_cx *= -1;
            }
            return d;
        }
        if (y < 0) {
            ll d = gcd(x, -y, out_cx, out_cy);
            if (out_cy) {
                *out_cy *= -1;
            }
            return d;
        }
        if (x > y) {
            return gcd(y, x, out_cy, out_cx);
        }
        if (x == 0) {
            if (out_cx && out_cy) {
                *out_cx = 0;
                *out_cy = 1;
            }
            return y;
        }
        ll q = y / x;
        ll r = y % x;
        ll d = gcd(r, x, out_cy, out_cx);
        if (out_cx) {
            *out_cx -= q * *out_cy;
        }
        return d;
    }
    static ll BASE;
    ll value = 0;
    static ll residue(ll value) { return (value % BASE + BASE) % BASE; }
    Mod()
    : value(0) {}
    Mod(ll value)
    : value(residue(value)) {}
    Mod operator+(const Mod& rhs) const { return Mod(value + rhs.value); }
    void operator+=(const Mod& rhs) { *this = *this + rhs; }
    Mod operator-(const Mod& rhs) const { return Mod(value - rhs.value); }
    void operator-=(const Mod& rhs) { *this = *this - rhs; }
    Mod operator*(const Mod& rhs) const { return Mod(value * rhs.value); }
    void operator*=(const Mod& rhs) { *this = *this * rhs; }
    Mod operator/(const Mod& rhs) const { return *this * rhs.inv(); }
    void operator/=(const Mod& rhs) { *this = *this / rhs; }
    Mod inv() const {
        if (value == 0) {
            assert(false);
            throw "[Mod::inv] div by zero";
        }
        ll ans, sub;
        ll d = Mod::gcd(value, BASE, &ans, &sub);
        if (d != 1) {
            assert(false);
            throw "[Mod::inv] not invertible";
        }
        return ans;
    }
};
ll Mod::BASE = 1000000007;

vector<Mod> fact_table;
vector<Mod> fact_inv_table;

Mod binom(ll n, ll k) {
    if (!(n >= 0 && 0 <= k && k <= n)) {
        return 0;
    }
    if (k == 0 || k == n) {
        return 1;
    }
    return fact_table[n] * fact_inv_table[k] * fact_inv_table[n-k];
}

Mod ans_for(ll I, ll J) {
    Mod ans = 0;
    rep(j,0,J+1) {
        ans += binom(j+1+I, I);
    }
    return ans;
}

int main() {
    ll r1, c1, r2, c2;
    cin >> r1 >> c1 >> r2 >> c2;
    r1--;
    c1--;
    fact_table.reserve(2000002);
    fact_table[0] = 1;
    rep(n,1,2000002) {
        fact_table[n] = fact_table[n-1] * n;
    }
    fact_inv_table.reserve(2000002);
    fact_inv_table[0] = 1;
    rep(n,1,2000002) {
        fact_inv_table[n] = fact_inv_table[n-1] / n;
    }
    Mod ans0 = ans_for(r2, c2);
    Mod ans1 = ans_for(r1, c2);
    Mod ans2 = ans_for(r2, c1);
    Mod ans3 = ans_for(r1, c1);
    Mod ans = ans0 - ans1 - ans2 + ans3;
    cout << ans.value << endl;
}


Measured memory_bytes: 31616