题解 | 1=N

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
void solve()
{
    ll n;cin>>n;
    vector<ll> yin_shu;
    for(ll i=2;i<=n;i++)
    {
        while(n%i==0)
        {
            
            yin_shu.push_back(i);
            n/=i; 
        }
    }
    if(n>1)
    {
        yin_shu.push_back(n);
    }
    ll sum=0;
    for(auto &i:yin_shu)
    {
        sum+=i;
    }
    cout<<sum;
    return;
}
int main() {
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    solve();
    return 0;
}
// 64 位输出请用 printf("%lld")