output_description: Print the minimum possible sum of the flight times.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      P Q R
attempt: d12 = int(input())
  d13 = int(input())
  d23 = int(input())
  dt1 = d12 + d23
  dt2 = d23 + d13
  dt3 = d13 + d12
  if dt1 < dt2 and dt1 < dt3:
      print(dt1)
  elif dt2 < dt1 and dt2 < dt3:
      print(dt2)
  else:
      print(dt3)
  
problem_description: Statement
  
  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?
samples: [{"input": "1 3 4", "output": "4\n    \n\n  * The sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n  * The sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n  * The sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n  * The sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n  * The sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n  * The sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\n* * *"}, {"input": "3 2 3", "output": "5"}]