CodeForces 455A

Boredom

time limit per test:： 1 second	memory limit per test: 256 megabytes

description：

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 ≤ 10^5) that shows how many numbers are in Alex’s sequence.

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

Output

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

Examples

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.

---

题目大意：
给出一组数字，选择一个ai，累加（并从数组中去掉这个数）。每选择一个以后，就会将数组内全部 等于ai-1 和 ai+1 的数删掉。重复选择，直到数组内没有数了，求累加和的最大值。

解题思路：
满足最优子结构的性质