Boredom

                                  Boredom 

Alex doesn’t like boredom. That’s why whenever he gets bored, he comes up with games. One long winter evening he came up with a game and decided to play it.

Given a sequence a consisting of n integers. The player can make several steps. In a single step he can choose an element of the sequence (let’s denote it ak) and delete it, at that all elements equal to ak + 1 and ak - 1 also must be deleted from the sequence. That step brings ak points to the player.

Alex is a perfectionist, so he decided to get as many points as possible. Help him.

Input
The first line contains integer n (1 ≤ n ≤ 105) that shows how many numbers are in Alex’s sequence.

The second line contains n integers a1, a2, …, an (1 ≤ ai ≤ 105).

Output
Print a single integer — the maximum number of points that Alex can earn.

Example

Input
2
1 2
Output
2

Input
3
1 2 3
Output
4

Input
9
1 2 1 3 2 2 2 2 3
Output
10

Note
Consider the third test example. At first step we need to choose any element equal to 2. After that step our sequence looks like this [2, 2, 2, 2]. Then we do 4 steps, on each step we choose any element equals to 2. In total we earn 10 points.

题目大意：给定n个数，每次可以选择删掉a[i]这个数，就会产生a[i]的价值，但是同时a[i]-1和a[i]+1这两个数也得被删掉，但是并不会产生价值。问能得到的最大的价值？

思路：DP。要抓住状态来找转移方程，重点就在a[i]这个数，我们设f[i]表示删掉i这个数能得到的最大价值,c[i]表示n个树中 i 这个数的个数，那么若i-1这个数已经被删掉，则f[i] = f[i-1];
若i-1没有被删掉，则f[i] = f[i-2] + c[i] * i;
初始化： f[0] = 0;f[1] = c[1];

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

long long c[100010],f[100010];
int n;

int main()
{
     while(~scanf("%d",&n))
    {
        int m = 0;
        memset(c,0,sizeof(c));
        memset(f,0,sizeof(f));
        int k;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&k);
            if(k > m) m = k;
            c[k]++;
        }
        f[0] = 0;f[1] = c[1];
        for(int i=2;i<=m;i++)
            f[i] = max(f[i-1],f[i-2]+c[i]*i);
        printf("%I64d\n",f[m]);
    }
    return 0;
}