#include <bits/stdc++.h>
using namespace std;
using lint = long long;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;

template<unsigned P> struct ModInt {
  using M = ModInt;
  unsigned v;
  constexpr ModInt() : v(0) {}
  constexpr ModInt(auto x) : v(x >= 0 ? x % P : (P - -x % P) % P) {}
  constexpr ModInt(unsigned v, int) : v(v) {}
  static constexpr unsigned p() { return P; }
  M operator+() const { return *this; }
  M operator-() const { return {v ? P - v : 0, 0}; }
  explicit operator bool() const noexcept { return v; }
  bool operator!() const noexcept { return !(bool)*this; }
  M operator*(M r) const { return M(*this) *= r; }
  M operator/(M r) const { return M(*this) /= r; }
  M operator+(M r) const { return M(*this) += r; }
  M operator-(M r) const { return M(*this) -= r; }
  bool operator==(M r) const { return v == r.v; }
  bool operator!=(M r) const { return !(*this == r); }
  M& operator*=(M r) { v = (uint64_t)v * r.v % P; return *this; }
  M& operator/=(M r) { return *this *= r.inv(); }
  M& operator+=(M r) { if ((v += r.v) >= P) v -= P; return *this; }
  M& operator-=(M r) { if ((v += P - r.v) >= P) v -= P; return *this; }
  M inv() const {
    int a = v, b = P, x = 1, u = 0;
    while (b) {
      int q = a / b;
      swap(a -= q * b, b);
      swap(x -= q * u, u);
    }
    assert(a == 1);
    return x;
  }
  M pow(auto n) const {
    if (n < 0) return pow(-n).inv();
    M res = 1;
    for (M a = *this; n; a *= a, n >>= 1) if (n & 1) res *= a;
    return res;
  }
  friend M operator*(auto l, M r) { return M(l) *= r; }
  friend M operator/(auto l, M r) { return M(l) /= r; }
  friend M operator+(auto l, M r) { return M(l) += r; }
  friend M operator-(auto l, M r) { return M(l) -= r; }
  friend ostream& operator<<(ostream& os, M r) { return os << r.v; }
  friend istream& operator>>(istream& is, M& r) { lint x; is >> x; r = x; return is; }
  friend bool operator==(auto l, M r) { return M(l) == r; }
  friend bool operator!=(auto l, M r) { return !(l == r); }
};
using Mint = ModInt<(unsigned)1e9 + 7>;
V<Mint> fact, ifact, inv, powB;
void init(int n, int B = 2) {
  fact.resize(n + 1);
  fact[0] = 1;
  for (int i = 1; i <= n; ++i) {
    fact[i] = i * fact[i - 1];
  }
  ifact.resize(n + 1);
  ifact[n] = 1 / fact[n];
  for (int i = n; i > 0; --i) {
    ifact[i - 1] = i * ifact[i];
  }
  inv.resize(n + 1);
  inv[1] = 1;
  for (int i = 2; i <= n; ++i) {
    int q = Mint::p() / i;
    inv[i] = -q * inv[Mint::p() - i * q];
  }
  powB.resize(n + 1);
  powB[0] = 1;
  for (int i = 0; i < n; ++i) {
    powB[i + 1] = powB[i] * B;
  }
}
Mint comb(int n, int r) {
  if (r < 0 or r > n) return 0;
  return fact[n] * ifact[r] * ifact[n - r];
}

constexpr double pi = acos(-1);
struct C {
  double x, y;
  C() : x(0), y(0) {}
  C(double x, double y) : x(x), y(y) {}
  C(double th) : x(cos(th)), y(sin(th)) {}
  C operator~() const { return {x, -y}; }
  C operator*(const C& r) const { return {x * r.x - y * r.y, x * r.y + y * r.x}; }
  C operator+(const C& r) const { return {x + r.x, y + r.y}; }
  C operator-(const C& r) const { return {x - r.x, y - r.y}; }
};
void fft(V<C>& a, bool inv = false) {
  int n = a.size();
  assert(__builtin_popcount(n) == 1);
  int j = 0;
  for (int i = 1; i < n; ++i) {
    int w = n >> 1;
    while (j >= w) j -= w, w >>= 1;
    j += w;
    if (i < j) swap(a[i], a[j]);
  }
  static VV<C> xi;
  for (int k = 0; 1 << k < n; ++k) if (k >= (int)xi.size()) {
    xi.emplace_back(1 << k);
    for (int i = 0; i < 1 << k; ++i) {
      xi[k][i] = C(i * pi / (1 << k));
    }
  }
  for (int k = 0; 1 << k < n; ++k) {
    const int w = 1 << k;
    for (int s = 0; s < n; s += 2 * w) {
      for (int i = s; i < s + w; ++i) {
        C p = a[i], q = a[i + w] * (inv ? ~xi[k][i - s] : xi[k][i - s]);
        a[i] = p + q, a[i + w] = p - q;
      }
    }
  }
}
template<unsigned P> V< ModInt<P> > multiply(const V< ModInt<P> >& a, const V< ModInt<P> >& b) {
  int na = a.size(), nb = b.size();
  if (!na or !nb) return {};
  int nc = na + nb - 1, n = 1 << __lg(2 * nc - 1);
  V<C> f(n), g(n);
  for (int i = 0; i < na; ++i) {
    f[i].x = a[i].v & ~(~0U << 15), f[i].y = a[i].v >> 15;
  }
  for (int i = 0; i < nb; ++i) {
    g[i].x = b[i].v & ~(~0U << 15), g[i].y = b[i].v >> 15;
  }
  fft(f), fft(g);
  V<C> Al(n), Au(n), Bl(n), Bu(n);
  for (int i = 0; i < n; ++i) {
    Al[i] = (f[i] + ~f[-i & n - 1]) * C(0.5, 0);
    Au[i] = (f[i] - ~f[-i & n - 1]) * C(0, -0.5);
    Bl[i] = (g[i] + ~g[-i & n - 1]) * C(0.5, 0);
    Bu[i] = (g[i] - ~g[-i & n - 1]) * C(0, -0.5);
  }
  for (int i = 0; i < n; ++i) {
    f[i] = Al[i] * Bl[i] + C(0, 1) * Al[i] * Bu[i];
    g[i] = Au[i] * Bl[i] + C(0, 1) * Au[i] * Bu[i];
  }
  fft(f, true), fft(g, true);
  V< ModInt<P> > c(nc);
  for (int i = 0; i < nc; ++i) {
    lint l = f[i].x / n + 0.5;
    lint m = (f[i].y + g[i].x) / n + 0.5;
    lint u = g[i].y / n + 0.5;
    c[i] = l + (m % P << 15) + (u % P << 30);
  }
  return c;
}

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  int n, a, b, c; cin >> n >> a >> b >> c;
  if (b & 1) return cout << 0 << '\n', 0;
  b >>= 1;
  init(n);

  if (!b) {
    Mint res;
    for (int y = 0; 3 * y <= c; ++y) {
      int z = c - 3 * y, w = a - z;
      if (w < 0) continue;
      res += fact[y + z + w] * ifact[y] * ifact[z] * ifact[w];
    }
    return cout << res << '\n', 0;
  }

  V<Mint> f(c + 1), g(c + 1);
  for (int i = 0; i <= c; ++i) {
    f[i] = comb(i + b - 1, i);
    if (i % 3 == 0) {
      g[i] = fact[a + b + i / 3] * ifact[i / 3];
    }
  }
  f = multiply(f, g);
  Mint res;
  for (int k = max(c - a, 0); k <= c; ++k) {
    res += ifact[b] * ifact[c - k] * ifact[a - c + k] * f[k];
  }
  cout << res << '\n';
}

Measured memory_bytes: 2176