#include<bits/stdc++.h>
using namespace std;
long long n,p1,p2,p3,ans=0,u1,u2,q;
bool v[1000010]={0};
int k=0;
int main(){
    freopen("burnTokyo.in","r",stdin);
    freopen("burnTokyo.out","w",stdout);
    cin>>n>>p1>>p2>>p3;
    if(p1==1||p2==1||p3==1){
        cout<<n<<endl;
        return 0;
    }
    if(p1==p2){
        u1=p1;u2=p3;k=1;
        if(u2==u1){
            q=u1;k=2;
        }
    }
    if(p2==p3){
        u1=p1;u2=p3;k=1;
        if(u2==u1){
            q=u1;k=2;
        }
    }
    if(p1==p3){
        u1=p1;u2=p2;k=1;
        if(u2==u1){
            q=u1;k=2;
        }
    }
    if(k==0)
    for(int i=0;i<=n/p1;i++){
        if(p1*i+1>n)break;
        for(int j=0;j<=n/p2;j++){
            if(p2*j+1>n||p2*j+p1*i+1>n)break;
            for(int k=0;k<=n/p3;k++){
                if(p3*k+1>n||p2*j+p1*i+p3*k+1>n)break;
                if(v[p1*i+p2*j+p3*k+1]==0)ans++,v[p1*i+p2*j+p3*k+1]=1;
            }
        }
    }
    if(k==1)
    for(int i=0;i<=n/u1;i++){
        if(u1*i+1>n)break;
        for(int j=0;j<=n/u2;j++){
            if(u2*j+1>n||u1*i+u2*j+1>n)break;
                if(v[u1*i+u2*j+1]==0)ans++,v[u1*i+u2*j+1]=1;
        }
    }
    if(k==2)
    for(int i=0;i<=n/q;i++){
        if(q*i+1>n)break;
        if(v[q*i+1]==0)ans++,v[q*i+1]=1;
    }
    cout<<ans<<endl;
    return 0;
}