Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Making a String

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given an alphabet consisting of *n* letters, your task is to make a string of the maximum possible length so that the following conditions are satisfied:

- the
*i*-th letter occurs in the string no more than*a*_{i}times; - the number of occurrences of each letter in the string must be distinct for all the letters that occurred in the string at least once.

Input

The first line of the input contains a single integer *n* (2 ≤ *n* ≤ 26) — the number of letters in the alphabet.

The next line contains *n* integers *a*_{i} (1 ≤ *a*_{i} ≤ 10^{9}) — *i*-th of these integers gives the limitation on the number of occurrences of the *i*-th character in the string.

Output

Print a single integer — the maximum length of the string that meets all the requirements.

Examples

Input

3

2 5 5

Output

11

Input

3

1 1 2

Output

3

Note

For convenience let's consider an alphabet consisting of three letters: "a", "b", "c". In the first sample, some of the optimal strings are: "cccaabbccbb", "aabcbcbcbcb". In the second sample some of the optimal strings are: "acc", "cbc".

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/19/2017 17:18:25 (c3).

Desktop version, switch to mobile version.

User lists

Name |
---|