#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;

ll extgcd(ll a, ll b, ll& x, ll& y){
  if(b==0){
    x=1, y=0; return a;
  }
  ll x1, y1;
  ll gcd=extgcd(b, a%b, x1, y1);
  x=y1; y=x1-(a/b)*y1;
  return gcd;
}

int main(void){
  ll n; cin >> n;
  ll p, q, r, a, b, c; cin >> p >> q >> r >> a >> b >> c;
  ll x, y;
  ll pq=p*q, pqr=p*q*r;
  extgcd(p, q, x, y);
  //px+qy=1
  //px=1 mod q
  //qy=1 mod p
  ll s=p*b%pq*x%pq+a*q%pq*y%pq; s=(s+pq)%pq;
  //x=s mod pq
  //x=c mod r
  extgcd(p*q, r, x, y);
  
  ll t=(pq*c)%pqr*x%pqr+s*r%pqr*y%pqr; t=(t+pqr)%pqr;
  //cout << pqr << ' ' << t << endl;
  if(t<0) cerr << 0;
  if(t>n){
    cout << 0 << endl; return 0;
  }
  ll left=0, right=2e18/pqr;
  while(right-left>1){
    ll mid=(left+right)/2;
    ll now=mid*pqr+t;
    if(now<=n) left=mid;
    else right=mid;
  }
  cout << right << endl;
  //キレたのでやめます
  return 0; 
}