Problem C. 6. Shopping
Input file name: standard input
Output file name: standard output
Time limit: 1 s
Memory limit: 1024 MB
Output file name: standard output
Time limit: 1 s
Memory limit: 1024 MB
From Petriukas' house to the first store the distance is x1 meters and to the second store – x2 meters. There is also a distance of x3 meters between the two stores.
Petriukas wants to visit both stores and return home. What is the shortest possible distance, assuming Petriukas starts at his home and can visit the stores multiple times or take the same path multiple times?
Input
Three natural numbers x1, x2, x3 (1 \le x1, x2, x3 \le 10^{8}).
Output
Output the shortest possible distance.
Examples
| standard input | standard output |
|---|---|
| 10 20 30 | 60 |
| 1 1 5 | 4 |