#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
//using mint = modint998244353;
template <typename T> bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; }
template <typename T> bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; }
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef pair<ll, int> P;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll a, ll b){return a * b / gcd(a, b);}
//Google出力用
void Case(int i,char a,int j){ printf("Case #%d: %c %d\n",i,a,j); }

int main(){
  ll a,b,c,d,e;
  cin>>a>>b>>c>>d>>e;
  ll x=lcm(a+b,c+d);
  ll moto=0;
  ll ans=0;
  ll cnt=0;
  ll r1=0,r2=0,r1_yasumi=0,r2_yasumi=0;
  bool hantei1=true;
  bool hantei2=true;
  while(x>cnt){
    if(cnt==x)break;
    if(cnt%(a+b)<a)hantei1=true;
    else hantei1=false;
    if(cnt%(c+d)<c)hantei2=true;
    else hantei2=false;
    cnt++;
    if(hantei1==true&&hantei2==true)moto++;
    //cout<<cnt<<" "<<hantei1<<" "<<hantei2<<" "<<moto<<endl;
  }
  if(e>=x){
    ans+=moto*(e/x);
    e-=x*(e/x);
    //cout<<ans<<" "<<moto<<" "<<e<<endl;
  }
  cnt=0;
  hantei1=true;
  hantei2=true;
  r1=0,r2=0,r1_yasumi=0,r2_yasumi=0;
  while(e>cnt){
    if(cnt==e)break;
    if(cnt%(a+b)<a)hantei1=true;
    else hantei1=false;
    if(cnt%(c+d)<c)hantei2=true;
    else hantei2=false;
    //cout<<cnt<<" "<<hantei1<<" "<<hantei2<<endl;
    if(hantei1==true&&hantei2==true)ans++;
    cnt++;
  }
  cout<<ans<<endl;
  return 0;
}