#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, x, y, z, p, k, ans, vis[100005];
long long a, b, xx, yy, tx, q, op, opp, aa, bb, aaa, bbb, f[100005];
struct node {
	int name, num;
	bool operator < (const node& p)const {
		return num > p.num;
	}
};
priority_queue<node> que;
inline void dijkstra() {
	memset(f, 0x3f, sizeof(f));
	f[0] = 0;
	que.push(node{0, 0});
	node u;
	while (que.size()) {
		u = que.top();
		que.pop();
		if (vis[u.name]) continue;
		vis[u.name] = 1;
		if (!vis[(u.name + x) % z] && f[(u.name + x) % z] > u.num + x) {
			f[(u.name + x) % z] = u.num + x;
			que.push(node{(u.name + x) % z, f[(u.name + x) % z]});
		}
		if (!vis[(u.name + y) % z] && f[(u.name + y) % z] > u.num + y) {
			f[(u.name + y) % z] = u.num + y;
			que.push(node{(u.name + y) % z, f[(u.name + y) % z]});
		}
	}
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> x >> y >> z;
	n--;
	if (__gcd(__gcd(x, y), z) != 1) {
		p = __gcd(__gcd(x, y), z);
		x /= p, y /= p, z /= p, n /= p;
	}
	if (x > y) swap(x, y);
	if (x > z) swap(x, z);
	if (y > z) swap(y, z);
	if (__gcd(x, y) == 1) {
	} else if (__gcd(x, z) == 1) {
		swap(y, z);
	} else {
		swap(x, z);
	}
	k = x * y - x - y, p = z / __gcd(x, z), q = z / __gcd(y, z), op = x / __gcd(x, y), opp = y / __gcd(x, y);
	ans += max(0ll, n - max(k, 0ll));
	if (k <= 0) {
		cout << ans + 1;
		return 0;
	}
	dijkstra();
	k = min(k, n);
	for (int i = 0; i < z; i++) {
		if (i == 0) {
			ans += max(0ll, k / z);
			continue;
		}
		if (i <= k % z) {
			ans += max(0ll, (k / z - f[i] / z) + 1);
		} else {
			ans += max(0ll, (k / z - f[i] / z));
		}
	}
	cout << ans + 1;
}