D1. Divan and Kostomuksha (easy version)

#include<iostream>
#include<cstdio>
#include<string>
#include<ctime>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<stack>
#include<climits>
#include<queue>
#include<map>
#include<set>
#include<sstream>
#include<cassert>
using namespace std;
//#define int long long
#define ll long long
const int N=5e6+10;
ll n,a[N],cnt[N];
ll dp[N];
void solve(){
    scanf("%lld",&n);
    for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
    for(int i=1;i<=n;i++){
        for(int j=1;j*j<=a[i];j++){
            if(a[i]%j==0){
                cnt[j]++;
                if(a[i]/j!=j) cnt[a[i]/j]++;
            }
        }
    }
    long long ans=0;
    dp[1]=n;
    for(int i=1;i<N;i++){
        for(int j=i*2;j<N;j+=i){
            dp[j]=max(dp[j],dp[i]+(j-i)*cnt[j]);
            ans=max(ans,dp[j]);
        }
    }
    cout<<ans<<endl;
}
int main(){
    solve();
}