Airplane

There are three airports A, B and C, and flights between each pair of airports in both directions.

A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.

Consider a route where we start at one of the airports, fly to another airport and then fly to the other airport.

What is the minimum possible sum of the flight times?

Constraints

• 1 \leq P,Q,R \leq 100
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

P Q R

Output

Print the minimum possible sum of the flight times.

Examples

Input

1 3 4

Output

4

Input

3 2 3

Output

5

inputFormat

input are integers.

Input

Input is given from Standard Input in the following format:

P Q R

outputFormat

Output

Print the minimum possible sum of the flight times.

Examples

Input

1 3 4

Output

4

Input

3 2 3

Output

5

样例

3 2 3

5