#include <bits/stdc++.h>
using namespace std;
int abs(int, int);
int gcd(int, int);
void solve() {
  int k, l, m, n, d, t = 0;
  cin >> k >> l >> m >> n >> d;
  int ar[d];
  for (int i = 0; i < d; i++) {
    ar[i] = 0;
  }
  for (int i = 0; i < d; i++) {
    if ((i + 1) % k == 0) ar[i] = 1;
  }
  for (int i = 0; i < d; i++) {
    if ((i + 1) % l == 0) ar[i] = 1;
  }
  for (int i = 0; i < d; i++) {
    if ((i + 1) % m == 0) ar[i] = 1;
  }
  for (int i = 0; i < d; i++) {
    if ((i + 1) % n == 0) ar[i] = 1;
  }
  for (int i = 0; i < d; i++) {
    if (ar[i] == 1) t++;
  }
  cout << t;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int TESTS = 1;
  while (TESTS--) {
    solve();
  }
  return 0;
}
int abs(int a, int b) {
  if (a > b)
    return a - b;
  else
    return b - a;
}
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
