human
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.

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.
assistant
#Here is Python code to print a single integer — the maximum number of points that Alex can earn.

from typing import Counter

n = int(input())
l = list(map(int, input().split()))

def solve(l):

    c = Counter(l)
    points = [0]*(max(l)+1)
    
    for i in sorted(list(set(l))):
        points[i] = i*c[i]

    def robber(points):
        if not points:
            return 0
        if len(points) == 1:
            return points[0]
        if len(points) == 2:
            return max(points[0],points[1])
        n = len(points)
        dp = [0] * (n)
        dp[0] = points[0]
        dp[1] = max(points[0],points[1])

        for i in range(2,len(points)):
            dp[i] = max(dp[i-1], points[i] + dp[i-2])

        return dp[-1]
    
    return robber(points)

print(solve(l))