p04047 AtCoder Grand Contest 001 - BBQ Easy
Snuke is having a barbeque party.

At the party, he will make N servings of Skewer Meal.

<image>

Example of a serving of Skewer Meal

He has a stock of 2N skewers, all of which will be used in Skewer Meal. The length of the i-th skewer is L_i. Also, he has an infinite supply of ingredients.

To make a serving of Skewer Meal, he picks 2 skewers and threads ingredients onto those skewers. Let the length of the shorter skewer be x, then the serving can hold the maximum of x ingredients.

What is the maximum total number of ingredients that his N servings of Skewer Meal can hold, if he uses the skewers optimally?

Constraints

* 1≦N≦100
* 1≦L_i≦100
* For each i, L_i is an integer.

Input

The input is given from Standard Input in the following format:


N
L_1 L_2 ... L_{2N}


Output

Print the maximum total number of ingredients that Snuke's N servings of Skewer Meal can hold.

Examples

Input

2
1 3 1 2


Output

3


Input

5
100 1 2 3 14 15 58 58 58 29


Output

135
```python
n=int(input())
l=sorted(list(map(int, input().split())))
ll=l[::2]
print(sum(ll))
```