#include #include #include long long t,stick,sum,whole,i,j; long long m = 1000000; int main() { char prime[m]; for (i=0;i0;t--) { scanf("%lld",&stick); if (stick == 1) { whole+=1; continue; } if (stick == 0) { sum = 0; break; } sum = stick; long long key =0; for (i=2;i<=sqrt(stick);i++) { if (i == stick && key==0) { sum = stick + 1; break; } else if (prime[i]!='0') { key = 1; while (stick%i==0) { sum+=(stick/i); stick= stick/i; } } } if (stick!=1) { stick = 1; sum+=1; } whole+=sum; } printf("%lld",whole); return 0; }