{"raw_statement":[{"iden":"problem statement","content":"There are three airports A, B and C, and flights between each pair of airports in both directions.\nA 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.\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\nWhat is the minimum possible sum of the flight times?"},{"iden":"constraints","content":"*   $1 \\leq P,Q,R \\leq 100$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$P$ $Q$ $R$"},{"iden":"sample input 1","content":"1 3 4"},{"iden":"sample output 1","content":"4\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."},{"iden":"sample input 2","content":"3 2 3"},{"iden":"sample output 2","content":"5"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}