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

import java.util.Scanner;

public class problem44B {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a = sc.nextInt(); //0.5 liter
		int b = sc.nextInt(); //1
		int c = sc.nextInt(); //2
		
		int cnt = 0;
		for(int i=c;i>=0;i--){
			for(int j=b;j>=0;j--){
				int val = n-(i*2+j*1);
				if(val>=0 && val/0.5<c) {
					cnt++;
				}
				/*
				for(int k=a;k>=0;k--){
					double sum = (i*2.0)+(j*1.0)+(k*0.5);
					//System.out.println(" 2리터 : "+i+", 1리터 : "+j+", 0.5리터 : "+k+" "+sum);
					if(sum == n) {
						cnt++;
					}
				}
				*/
			}
		}
		System.out.println(cnt);
	}

}
