//include //------------------------------------------ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //conversion //------------------------------------------ inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; } template inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } //math //------------------------------------------- template inline T sqr(T x) { return x * x; } //typedef //------------------------------------------ typedef vector VI; typedef vector VVI; typedef vector VS; typedef pair PII; typedef long long LL; //container util //------------------------------------------ #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define MP make_pair #define SZ(a) int((a).size()) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define EXISTch(s,c) ((((s).find_first_of(c)) != std::string::npos)? 1 : 0)//cがあれば1 if(1) #define SORT(c) sort((c).begin(),(c).end()) #define REP(i,n) for(int i=0;i<(int)n;++i) #define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i) //constant //-------------------------------------------- const double EPS = 1e-10; const double PI = acos(-1.0); const int INF = (int)1000000007; const LL MOD = (LL)1000000007;//10^9+7 const LL INF2 = (LL)100000000000000000;//10^18 LL gcd(LL a, LL b) { return b != 0 ? gcd(b, a % b) : a; } LL lcm(LL a, LL b) { return a * b / gcd(a, b); } int main() { LL n; cin >> n; vector a(3); for (int i = 0; i < 3; i++) { cin >> a[i]; } LL ans = 0; for (int i = 0; i < 3; i++) { ans += n / a[i]; } for (int i = 0; i < 3; i++) { for (int j = i+1; j < 3; j++) { if (i == j)continue; ans -= (n / lcm(a[i], a[j])); } } ans += n / (lcm(lcm(a[0], a[1]), a[2])); cout << ans << endl; return 0; }