#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000008, MOD = 998244353, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];

ll a[N], r[N];
ll Exgcd(ll a, ll b, ll &x, ll &y) {
  if (!b) {
    x = 1;
    y = 0;
    return a;
  }
  ll d = Exgcd(b, a % b, x, y);
  ll t = x;
  x = y;
  y = t - (a / b) * y;
  return d;
}
ll g;
ll CRT(int k, ll* a, ll* r) {
  __int128_t n = 1, ans = 0;
  for (int i = 1; i <= k; i++) n = n * r[i];
  g = n;
  for (int i = 1; i <= k; i++) {
    ll m = n / r[i], b, y;
    Exgcd(m, r[i], b, y); 
    ans = (ans + (__int128_t)a[i] * m % n * b % n) % n;
  }
  return (ans % n + n) % n;
}

int main() {
    ll n;
    cin >> n;
    for (int i = 1; i <= 3; i++) cin >> a[i];
    for (int i = 1; i <= 3; i++) cin >> r[i];
    ll t = CRT(3, r, a);

    if (t > n) puts("0");
    else printf("%lld\n", 1 + (n - t) / g);
    return 0;
}