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

//package school2;

import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class B {
	Scanner in;
	PrintWriter out;
//	String INPUT = "10000 5000 5000 5000";
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int a = ni();
		int b = ni();
		int c = ni();
		
		int[] dp = new int[2*n+1];
		dp[0] = 1;
		int[] dpa = new int[2*n+1];
		for(int i = 0;i <= 2 * n;i++){
			for(int j = 0;j <= a && i + j <= 2 * n;j++){
				dpa[i + j] += dp[i];
			}
		}
		int[] dpb = new int[2*n+1];
		for(int i = 0;i <= 2 * n;i++){
			for(int j = 0;j <= b && i + 2 * j <= 2 * n;j++){
				dpb[i + 2 * j] += dpa[i];
			}
		}
		int[] dpc = new int[2*n+1];
		for(int i = 0;i <= 2 * n;i++){
			for(int j = 0;j <= c && i + 4 * j <= 2 * n;j++){
				dpc[i + 4 * j] += dpb[i];
			}
		}
		
		out.println(dpc[2*n]);
	}
	
	void run() throws Exception
	{
		in = INPUT.isEmpty() ? new Scanner(System.in) : new Scanner(INPUT);
		out = new PrintWriter(System.out);

		solve();
		out.flush();
	}
	
	
	public static void main(String[] args) throws Exception
	{
		new B().run();
	}
	
	int ni() { return Integer.parseInt(in.next()); }
	void tr(Object... o) { if(INPUT.length() != 0)System.out.println(o.length > 1 || o[0].getClass().isArray() ? Arrays.deepToString(o) : o[0]); }
}
