#include using namespace std; int check(long long n) { int i,j; for(i=2;i<=sqrt(n);i++) { if(n%i==0) { return 0; } } return 1; } long long int primeFactors(long long int n) { long long val, f=0; while (n%2 == 0) { val = 2; f=1; break; } int flag=0; if(f==0) { for (int i = 3; i <= sqrt(n); i = i+2) { while (n%i == 0) { val = i; flag=1; break; } if(flag==1) break; } } if(f!=1 && flag!=1) { if (n > 2) val = n; } return val; } int main() { int n; cin>>n; long long sum =0; while(n--) { long long num ; cin>>num; int i,j; if(num==1) { sum = sum +1; } else if(check(num)==1) { sum = sum + num+1; } else { while(num!=1) { sum = sum + num; long long int div = primeFactors(num); //cout<