#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    int a, b, c, d, e;
    cin >> a >> b >> c >> d >> e;
    int ab = a + b;
    int cd = c + d;
    int f[ab*cd] = {};
    int sum = 0;
    rep(i,ab*cd){
        if(i % ab < a && i % cd < c) f[i] = 1;
        sum += f[i];
    }
    int ans = 0;
    ans = e / (ab*cd) * sum;
    e %= (ab*cd);
    rep(i,e){
        ans += f[i];
    }
    cout << ans << endl;
    return 0;
}