#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

template<int MOD>
class ModInt {
public:
    ModInt() :value(0) {}
    ModInt(long long val) :value((int)(val<0 ? MOD + val%MOD : val%MOD)) { }

    ModInt& operator+=(ModInt that) {
        value = value + that.value;
        if (value >= MOD)value -= MOD;
        return *this;
    }
    ModInt& operator-=(ModInt that) {
        value -= that.value;
        if (value<0)value += MOD;
        return *this;
    }
    ModInt& operator*=(ModInt that) {
        value = (int)((long long)value * that.value % MOD);
        return *this;
    }
    ModInt &operator/=(ModInt that) {
        return *this *= that.inverse();
    }
    ModInt operator+(ModInt that) const {
        return ModInt(*this) += that;
    }
    ModInt operator-(ModInt that) const {
        return ModInt(*this) -= that;
    }
    ModInt operator*(ModInt that) const {
        return ModInt(*this) *= that;
    }
    ModInt operator/(ModInt that) const {
        return ModInt(*this) /= that;
    }
    ModInt pow(long long k) const {
        if (value == 0)return 0;
        ModInt n = *this, res = 1;
        while (k) {
            if (k & 1)res *= n;
            n *= n;
            k >>= 1;
        }
        return res;
    }
    ModInt inverse() const {
        long long a = value, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }
    int toi() const { return value; }

private:
    int value;
};
typedef ModInt<1000000007> mint;
ostream& operator<<(ostream& os, const mint& x) {
    os << x.toi();
    return os;
}

vector<vector<int>> combinations(int n, int mod) {
    auto res = vector<vector<int>>(n + 1, vector<int>(n + 1));
    rep(i, n + 1) res[i][0] = 1;
    for (int i = 1; i <= n; ++i) for (int j = 1; j <= i; ++j)
        res[i][j] = (res[i - 1][j - 1] + res[i - 1][j]) % mod;
    return res;
}

mint solve() {
    int N, R, G, B;
    cin >> N >> R >> G >> B;

    vector<mint> fact(N + 1, 1), p2(N + 1, 1);
    auto C = combinations(N, (int)1e9 + 7);
    rep(i, N) {
        fact[i + 1] = fact[i] * (i + 1);
        p2[i + 1] = p2[i] * 2;
    }
    int a = N - R - G - B;
    int col = R + G + B;
    if (a < 0)return 0;

    mint ans;
    for (int x = 0; x * 2 <= N - a; ++x) {
        int y = N - a - x * 2;
        if (x * 2 + y != col)continue;
        if (a < x + y - 1)continue;
        // 空白、2色、1色の配置
        mint z = fact[x + y] / (fact[x] * fact[y]) * C[a + 1][x + y];
        for (int r2 = 0; r2 <= min(x, R); ++r2) {
            int gb = x - r2;
            if (gb > G || gb > B)continue;
            int r = R - r2, g = G - gb, b = B - gb;
            if (r > y)continue;
            // 孤立した赤の配置
            mint w = C[y][r];
            // 緑、青の並び順
            if (r2 + y - r != g + b)continue;
            w *= fact[g + b] / (fact[g] * fact[b]);
            // {赤, ?}と{緑,青}だけ考慮した並び順
            w *= fact[x] / (fact[r2] * fact[x - r2]);
            // {hoge, piyo} => (hoge, piyo), (piyo, hoge)
            w *= p2[x];
            ans += z * w;
        }
    }
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << solve() << endl;
}