#include<iostream>
#include<queue>
using namespace std;
int x,y,z;
long long h,f[100005],ans;
bool vis[100005];
struct node{int x,d;};
bool operator<(const node& a,const node& b){return a.d>b.d;}
vector<node>a[100005];
priority_queue<node>q;
int main()
{
	cin>>h>>x>>y>>z;
	h--;
	for(int i=1;i<x;i++)f[i]=(1ull<<63)-1;
	for(int i=0;i<x;i++)
	{
		a[i].push_back(node{(i+y)%x,y});
		a[i].push_back(node{(i+z)%x,z});
	}
	q.push({0,0});
	while(!q.empty())
	{
		int x=q.top().x;
		q.pop();
		if(vis[x])continue;
		vis[x]=1;
		for(int i=0;i<a[x].size();i++)
			if(f[a[x][i].x]>f[x]+a[x][i].d)
			{
				f[a[x][i].x]=f[x]+a[x][i].d;
				q.push(node{a[x][i].x,f[a[x][i].x]});
			}
	}
	for(int i=0;i<x;i++)if(h>=f[i])ans+=(h-f[i])/x+1;
	cout<<ans;
	return 0;
}