Codeforces_731F_(前缀和)

F. Video Cards

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Little Vlad is fond of popular computer game Bota-2. Recently, the developers announced the new add-on named Bota-3. Of course, Vlad immediately bought only to find out his computer is too old for the new game and needs to be updated.

There are n video cards in the shop, the power of the i-th video card is equal to integer value ai. As Vlad wants to be sure the new game will work he wants to buy not one, but several video cards and unite their powers using the cutting-edge technology. To use this technology one of the cards is chosen as the leading one and other video cards are attached to it as secondary. For this new technology to work it's required that the power of each of the secondary video cards is divisible by the power of the leading video card. In order to achieve that the power of any secondary video card can be reduced to any integer value less or equal than the current power. However, the power of the leading video card should remain unchanged, i.e. it can't be reduced.

Vlad has an infinite amount of money so he can buy any set of video cards. Help him determine which video cards he should buy such that after picking the leading video card and may be reducing some powers of others to make them work together he will get the maximum total value of video power.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the number of video cards in the shop.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 200 000) — powers of video cards.

Output

The only line of the output should contain one integer value — the maximum possible total power of video cards working together.

Examples

input

4
3 2 15 9

output

27

input

4
8 2 2 7

output

18

Note

In the first sample, it would be optimal to buy video cards with powers 3, 15 and 9. The video card with power 3should be chosen as the leading one and all other video cards will be compatible with it. Thus, the total power would be 3 + 15 + 9 = 27. If he buys all the video cards and pick the one with the power 2 as the leading, the powers of all other video cards should be reduced by 1, thus the total power would be 2 + 2 + 14 + 8 = 26, that is less than 27. Please note, that it's not allowed to reduce the power of the leading video card, i.e. one can't get the total power3 + 1 + 15 + 9 = 28.

In the second sample, the optimal answer is to buy all video cards and pick the one with the power 2 as the leading. The video card with the power 7 needs it power to be reduced down to 6. The total power would be8 + 2 + 2 + 6 = 18.

题意：一串数字，选择一个作为leading，再找多个Secondary，要求Secondary要能被leading整除，Secondary可以任意减小，leading不能减小，将leading和Secondary加和。问最大的和为多少。

思路：一眼看去没有思路，看了别人的题解。枚举leading，找p*leading—(p+1)*leading之间数字的个数；所以使用前缀和，cnt[num-1]-cnt[num-x-1]为[num-x,num)之间数字的个数。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define LL long long
#define N 200005

int num[N];
int cnt[N];
bool vis[N];
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        memset(vis,0,sizeof(vis));
        memset(cnt,0,sizeof(cnt));
        int maxn=0;
        for(int i=0; i<n; i++)
        {
            scanf("%d",&num[i]);
            maxn=max(maxn,num[i]);
            cnt[num[i]]++;
        }
        sort(num,num+n);
        for(int i=1; i<=maxn; i++)
            cnt[i]+=cnt[i-1];
        LL res=0;
        for(int i=0; i<n; i++)
        {
            LL tmp=0;
            if(!vis[num[i]])
            {
                vis[num[i]]=1;
                for(int j=num[i]; j<=maxn; j+=num[i])
                {
                    tmp+=(cnt[j-1]-cnt[j-num[i]-1])*(LL)(j-num[i]);
                    if(j+num[i]>maxn)
                        tmp+=(cnt[maxn]-cnt[j-1])*(LL)j;
                }
                res=max(tmp,res);
            }
        }
        if(n==1)
            printf("%d
",num[0]);
        else
            printf("%I64d
",res);
    }
    return 0;
}