eolymp
Competitions

Week 2 Conditionals Part 1

Lazy Misha

Time limit 1 second
Memory limit 128 MiB

Misha wants to play football with guys and was about to leave the house, but he was caught by mom, who told him that if he won't help her in the house, he will not go to the football. Mom suggested that Misha do one of three things: either wash the dishes, vacuum the apartment, or play with his younger sister Marina, while the mother goes to the store. Misha wondered how long it takes for each case:

  • Washing the dishes takes t[1] seconds;

  • Vacuuming the apartment takes t[2] seconds;

  • Playing with Marinka takes t[3] seconds.

It is obvious that Misha will choose the work that takes the least time. Your program must give the time during which Misha will perform the mother's job.

Input data

Three integers t[1], t[2], t[3] (1 ≤ t[1], t[2], t[3] ≤ 1000).

Output data

Print the minimum time to do the mom's job for Misha.

Examples

Input example #1 
31 15 40
Output example #1 
15