#include "bits/stdc++.h"
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const long long mod = 1e9 + 7;

ll gcd(ll a, ll b) {
	return b ? gcd(b, a % b) : a;
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

int main() {
	ll ans=0;;

	rep(i, 5) {
		int n;
		cin >> n;
		if (n % 3 == 0 && n % 5 == 0) {
			ans+=8;
		} else if (n % 3 == 0 || n % 5 == 0) {
			ans+=4;
		} else {
			ans+=to_string(n).size();
		}
	}

	cout << ans << endl;
}