#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

template<typename T1,typename T2>ostream& operator<<(ostream& os,const pair<T1,T2>& a) {os << "(" << a.first << ", " << a.second << ")";return os;}

const char newl = '\n';

int main() {
    int a,b,c,d,e;
    cin >> a >> b >> c >> d >> e;
    int cnt = 0;
    for (int i = 0;i < (a+b)*(c+d);++i) if (i%(a+b) < a && i%(c+d) < c) cnt++;
    int ans = cnt*(e/((a+b)*(c+d)));
    for (int i = 0;i < e%((a+b)*(c+d));++i) if (i%(a+b) < a && i%(c+d) < c) ans++;
    cout << ans << newl;
}