#abc207a. [abc207_a]Repression
[abc207_a]Repression
Problem Statement
There are three cards on the desk, each with a positive integer written on it. The integers on the cards are , , and .
You have chosen two cards and picked them up.
Find the maximum possible sum of the integers written on the picked cards.
Constraints
- All values in input are integers.
Input
Input is given from Standard Input in the following format:
Output
Print the answer as an integer.
Sample Input 1
3 4 5
Sample Output 1
9
If you pick up two cards with and , the sum of the integers will be .
There is no way to pick up cards with a greater sum, so we should print .
Sample Input 2
6 6 6
Sample Output 2
12
Whichever two cards you choose, the sum of the integers will be .
Sample Input 3
99 99 98
Sample Output 3
198