10 20 10 5
 20 1 2 3
 7 2 2 2
 25 10 5 10
 999 999 899 299
 10000 5000 0 5000
 2 2 2 2
 1 0 2 0
 3 3 2 1
 1 1 0 0
 1 0 0 1
 20 10 20 30
 505 142 321 12
 101 10 10 50
 10 19 15 100
 10000 5000 5000 0
 1234 645 876 1000
 3 10 10 10
 1 0 1 0
 7 3 0 5
 101 10 0 50
 1 0 0 0
 10 0 8 10
 1 2 0 0
 5 2 1 1
 8765 2432 2789 4993
 8987 4000 2534 4534
 10000 5000 5000 5000
 10000 5000 2500 2500
 10000 0 5000 5000
 10000 4999 2500 2500
 5 5000 5000 5000
 10000 4534 2345 4231
 5643 1524 1423 2111
 7777 4444 3333 2222
 2500 5000 5000 5000
 10000 2500 2500 2500
 5000 5000 5000 5000

36
 0
 1
 12
 145000
 1251
 3
 1
 3
 0
 0
 57
 0
 33
 35
 0
 141636
 6
 1
 1
 3
 0
 5
 1
 0
 1697715
 2536267
 6253751
 1
 2501
 0
 12
 2069003
 146687
 1236544
 1565001
 0
 4691251

#include <bits/stdc++.h>
using namespace std;
static const double EPS = 1e-12;
int bots[3];
long long mem[10001][3];
long long solve(int left, int cur) {
  if (cur == 3) return left == 0 ? 1LL : 0LL;
  if (left < 0) return 0LL;
  long long &ret = mem[left][cur];
  if (ret < 0LL) {
    ret = 0LL;
    if (cur == 0) {
      for (int i = 0; i <= bots[0]; i += 2) {
        ret += solve(left - i / 2, cur + 1);
      }
    } else if (cur == 1) {
      for (int i = 0; i <= bots[1]; ++i) {
        ret += solve(left - i, cur + 1);
      }
    } else {
      assert(cur == 2);
      for (int i = 0; i <= bots[2]; ++i) {
        ret += solve(left - 2 * i, cur + 1);
      }
    }
  }
  return ret;
}
int main(void) {
  int n;
  cin >> n;
  cin >> bots[0] >> bots[1] >> bots[2];
  for (int i = 0; i < (10001); ++i)
    for (int j = 0; j < (3); ++j) mem[i][j] = -1LL;
  cout << solve(n, 0) << endl;
  return 0;
}
