#include <bits/stdc++.h>
using namespace std;
int main() {
  queue<int> q;
  int k, l, m, n;
  int d, cnt = 0;
  cin >> k >> l >> m >> n >> d;
  for (int i = 1; i <= d; i++) {
    q.push(i);
  }
  for (int i = 1; i <= d; i++) {
    int x = q.front();
    q.pop();
    if (x % k == 0 || x % l == 0 || x % m == 0 || x % n == 0) cnt++;
  }
  cout << cnt;
}
