#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;

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

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


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