package main

import . "fmt"
import . "math/big"

func main() {
	var n,p,q,r,a,b,c int64
	Scan(&n,&p,&q,&r,&a,&b,&c)
	ans := solve(n,p,q,r,a,b,c)
	Println(ans)
}

func solve(n,p,q,r,a,b,c int64) (ans int64) {
	pqr := p*q*r
	X, Y, Z := new(Int), new(Int), new(Int)
	new(Int).GCD(nil, X, NewInt(p), NewInt(pqr/p))
	new(Int).GCD(nil, Y, NewInt(q), NewInt(pqr/q))
	new(Int).GCD(nil, Z, NewInt(r), NewInt(pqr/r))
	x := X.Mul(X, NewInt(pqr/p)).Int64() * a
	y := Y.Mul(Y, NewInt(pqr/q)).Int64() * b
	z := Z.Mul(Z, NewInt(pqr/r)).Int64() * c
	xyz := x+y+z
	m := new(Int).Mod(NewInt(xyz), NewInt(pqr)).Int64()
	ans = n / pqr
	if n - ans * pqr >= m {
		ans++
	}
	return
}