/* realRPG | India */ #include "bits/stdc++.h" #define ll long long #define vi vector #define vs vector #define vll vector #define vpii vector > #define vpss vector > #define vpll vector > #define pii pair #define pll pair #define pss pair #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define fi(i,a,b,c) for(int i=a; i=b; i-=c) #define rfl(i,a,b,c) for(long long i=a; i>=b; i-=c) #define pb push_back #define mk make_pair #define ep emplace_back #define F first #define S second using namespace std; const ll md = 1e9 + 7; const ll MAX = 1e5 + 5; const ll MAXN = 1e6 + 10; /*inline ll fsc() { ll ip = getchar(), ret = 0, flag = 1; for (; ip<'0' || ip>'9'; ip = getchar()) if (ip == '-') { flag = -1; ip = getchar(); break; } for (; ip >= '0'&&ip <= '9'; ip = getchar()) ret = ret * 10 + ip - '0'; return flag*ret; }*/ ll fun1(ll x) { if(x%2==0) { return x/2; } ll res=0; ll flag=0; fi(i,3,1000001,2) { if(x%i==0) { res=i; flag=1; break; } } if(flag==1) return x/res; else return 1; } ll fun(ll x) { ll res=x; while(x>1) { x=fun1(x); res+=x; } return res; } void solve() { ll n; cin >>n; ll sum=0; while(n--) { ll x; cin >>x; sum+=fun(x); } cout <