#include #include #include long long divisor(long long n) { if(n%2==0 && n!=2) return 2; else { for(int i=3; i<=floor(sqrt(n)); i+=2) if(n%i==0) return i; } return 1; } int main() { int n; long long moves=0; scanf("%d", &n); while(n--) { long long x; scanf("%lld", &x); if(x==1) { moves=moves+1; continue; } while(1) { if(divisor(x)==1) { moves=moves+x+1; break; } moves = moves + x; x = x/divisor(x); } } printf("%lld\n", moves); }