#include <cstdio>
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
ll pow(ll x,ll n)
{
    ll f=1;
    for(ll i=1;i<=n;i++)
    {
        f*=x;
    }
    return f;
}
ll solve(ll n)
{
    ll ans=1;
    for(ll i=2;i*i<=n;i++)
    {
        if(n%i==0)
        {
            //cout<<i<<endl;
            ll temp=1;
            ll ret=1;
            while(n%i==0)
            {
                temp+=pow(i,ret++);
                n/=i;
            }
            ans*=temp;
        }
    }
     if(n>1) ans*=(n+1);
    return ans;
}
int main()
{
    ll t;
    cin>>t;
    while(t--)
    {
        ll n;
        cin>>n;
        cout<<solve(n)-n<<endl;
    }
    return 0;
}