#include <stdio.h>

// 再帰的に最大公約数を求める関数
int gcd_recursive(int a, int b) {
    if (b == 0)
        return a;
    return gcd_recursive(b, a % b);
}

// 最小公倍数を求める関数
int lcm_recursive(int a, int b) {
    return (a * b) / gcd_recursive(a, b);
}

int main(void){
	long val;
	scanf("%ld",&val);
	int arr[3];
	scanf("%d%d%d",&arr[0], &arr[1], &arr[2]);
	
	long ans = 0;
	
	int save = 0;
	for(int i = 0;i < 3;i ++){
		ans += val / arr[i];
		
		if(i == 2 && lcm_recursive(arr[i],arr[i - 2]) != save){
			ans -= val / lcm_recursive(arr[i],arr[i - 2]);
			save = lcm_recursive(arr[i],arr[i - 2]);
		}else if(lcm_recursive(arr[i],arr[i + 1]) != save){
			ans -= val / lcm_recursive(arr[i],arr[i + 1]);
			save = lcm_recursive(arr[i],arr[i + 1]);
		}
	}
	int tmp = lcm_recursive(arr[0], arr[1]);
	
	ans += lcm_recursive(tmp, arr[2]);
	printf("%ld",ans);
}