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;
int cnt[20005];
int d[4];
int main() {
  int i, j, k, n, max, v, goal;
  while (scanf("%d", &n) != EOF) {
    for (i = 1; i <= 3; i++) scanf("%d", &d[i]);
    max = 0;
    goal = n * 2;
    memset(cnt, 0, sizeof(cnt));
    cnt[0] = 1;
    for (i = 1; i <= 3; i++) {
      if (i == 1)
        v = 1;
      else if (i == 2)
        v = 2;
      else if (i == 3)
        v = 4;
      for (j = max; j >= 0; j--) {
        if (cnt[j]) {
          for (k = 1; k <= d[i]; k++) {
            if (j + k * v > goal) break;
            cnt[j + k * v] += cnt[j];
          }
        }
      }
      max += v * d[i];
      if (max > goal) max = goal;
    }
    printf("%d\n", cnt[goal]);
  }
  return 0;
}
