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 mod = 1e9 + 7, gaymod = 998244353, MAX = 1000000000;
long long int gcd(long long int x, long long int y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
long long lcm(long long a, long long b) {
  long long g = gcd(a, b);
  return a / g * b;
}
long long binexp(long long a, long long b) {
  if (b == 0) return 1;
  long long res = binexp(a, b / 2);
  if (b % 2)
    return (res * res * a);
  else
    return (res * res);
}
int prime(long long x) {
  if (x % 2 == 0 && x != 2)
    return 0;
  else {
    for (int i = 3; long long(i * i) <= x; i += 2) {
      if (x % i == 0) return 0;
    }
  }
  return 1;
}
const int N = 2e5 + 5;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  mt19937 rng(
      (unsigned int)chrono::steady_clock::now().time_since_epoch().count());
  ;
  int t;
  t = 1;
  while (t--) {
    int n, a, b, c;
    cin >> n >> a >> b >> c;
    int ans = 0;
    for (int i = 0; i <= a; i += 2) {
      for (int j = 0; j <= b; j++) {
        if ((n - (i / 2 + j)) % 2 == 0 && (n - (i / 2 + j)) / 2 <= c) ans++;
      }
    }
    cout << ans;
    cout << "\n";
  }
  return 0;
}
