#include <iostream>
#include <vector>
#include <utility>
#include <map>
#include <algorithm>
#include <queue>
#include <cmath>

using namespace std;

void divisers(long long n, map<long long, long long>& mp) {
    for (long long i=2; i*i<=n; i++) {
        while (n%i == 0) {
            mp[i]++;
            n /= i;
        }
    }
    if (n != 1) mp[n]++;
}

int main() {
    int n;
    cin >> n;

    long long k = 1;
    long long ans = 0;
    map<long long, long long> mp;

    for (int i=0; i<n; i++) {
        long long p;
        cin >> p;
        divisers(p,mp);
    }

    while(mp[2]>0 && mp[5]>0) mp[2]--,mp[5]--;
    for (auto p : mp) {
        for (int i=0; i<p.second; i++) {
            k *= p.first;
        }
    }

    while (k>0) {
        ans += k%10;
        k /= 10;
    }

    cout << ans << endl;
}