A. One Must Imagine Time Tight,
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Recently, OC, KP, and XW teamed up to participate in the $$$\infty$$$-th China Collegiate Programming Contest in another world. But unfortunately, they woke up too late to catch up with their plan, and the hotel they booked was far away from the competition venue due to heavy expenses, so they decided to take a taxi directly.

According to the navigation, there were $$$3$$$ candidate plans for them to choose from, with time costs $$$a$$$, $$$b$$$, and $$$c$$$. As you can see, the time may be tight, so they need to pick out the plan with the minimum time cost. Can you help them?

Input

The first line contains $$$3$$$ integers $$$a, b, c$$$ $$$(1 \leq a, b, c \leq 60)$$$, denoting the time cost of the $$$3$$$ plans.

Output

Output one line containing one integer $$$x$$$, denoting the minimum time cost among these $$$3$$$ plans.

Examples
Input
14 12 18
Output
12
Input
1 1 45
Output
1
Note

For the first sample test case, the time cost of the $$$3$$$ plans was $$$14, 12, 18$$$ respectively. The $$$2$$$-nd plan had the minimum time cost, so you need to choose it and output its time cost $$$12$$$.

For the second sample test case, you can choose the $$$1$$$-st or the $$$2$$$-nd plan since they share the same time cost, and output any of their time costs $$$1$$$.