#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <string>
#include <tuple>
#include <functional>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <map>
#include <random>
//#include "toollib.h"
#define INT_MAX 2147483647
#define Loop(i, n) for(int i = 0; i < (int)n; i++)
#pragma warning (disable:4018)

using namespace std;
typedef long long int lint;

lint solve_GCD(lint x, lint y) {
	while (x != y) {
		if (x > y) {
			x -= y;
		}
		else {
			y -= x;
		}
	}
	return x;
}

lint solve_LCM(lint x, lint y) {
	lint z = solve_GCD(x, y);
	return (lint)x*y / z;
}


//***** Main Program *****
int main() {
	lint N;
	vector<lint> a(3);
	cin >> N >> a[0] >> a[1] >> a[2];
	sort(a.begin(), a.end(), greater<lint>());
	lint lcm01 = solve_LCM(a[0], a[1]);
	lint lcm12 = solve_LCM(a[1], a[2]);
	lint lcm20 = solve_LCM(a[2], a[0]);
	lint lcm = solve_LCM(a[0], lcm12);
	lint x0 = N / a[0];
	lint x1 = N / a[1];
	lint x2 = N / a[2];
	lint xx01 = N / lcm01;
	lint xx12 = N / lcm12;
	lint xx20 = N / lcm20;
	lint xxx = N / lcm;
	lint ret = x0 + x1 + x2 - xx01 - xx12 - xx20 + xxx;
	cout << ret << endl;
}