CodeForces 148A

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int k, l, m, n, d, u;
int num[100005];
int main()
{
    while (cin >> k >> l >> m >> n >> d)
    {
        int cnt = 0;
        memset(num , 0,sizeof(num));
        for (int i = k; i <= d; i = i + k)
            num[i] = 1;
        for (int i = l; i <= d; i = i + l)
            num[i] = 1;
        for (int i = m; i <= d; i = i + m)
            num[i] = 1;
        for (int i = n; i <= d; i = i + n)
            num[i] = 1;
        for (int i = 1; i <= d; i++)
            if (num[i] == 1)
                cnt++;
        cout << cnt << endl;
    }
}