#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;
 
const int inf = (int)1e9; 
 
ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}

ll dp[100];

int main(void){
	int ans = 0;
	for(int i=0;i<5;i++){
		int a;
		cin>>a;
		if(a%3==0){
			if(a%5==0)ans+=8;
			else ans+=4;
		}
		else{
			if(a%5==0)ans+=4;
			else{
				int t = 0;
				while(a>=10){
					a/=10;
					t++;
				}
				t++;
				ans+=t;
			}
		}
	}
	cout<<ans<<endl;
	return 0;
}