{"raw_statement":[{"iden":"statement","content":"Let's consider The National University of Colombia (UNAL) as a large coordinate plane centered at the most emblematic place of the University, the Che Square.\n\nTwo friends are attending classes and now they may need to move in order to attend their next classes. The first of them is currently at a building located at $A$ and needs to go to the building located at $B$, the second friend is currently at a building located at $C$ and needs to go to the building located at $D$.\n\nThey start to move at the same time, both of them move in a straight line and with the same constant speed. If one of them reaches his destination first, he will remain there, while the other one is still moving.\n\nYour task is to find the minimum distance between the two friends during their change of classes.\n\nYou are given two lines each of them containing 4 integers separated by spaces. The first line contains $A. x$, $A. y$, $B. x$ and $B. y$. The second line contains $C. x$, $C. y$, $D. x$ and $D. y$. The absolute value of each coordinate doesn't exceed $10^9$.\n\nOutput one line containing the answer to the task. Your answer will be considered correct if the absolute or relative error is at most $10^(-6)$.\n\n"},{"iden":"input","content":"You are given two lines each of them containing 4 integers separated by spaces. The first line contains $A. x$, $A. y$, $B. x$ and $B. y$. The second line contains $C. x$, $C. y$, $D. x$ and $D. y$. The absolute value of each coordinate doesn't exceed $10^9$."},{"iden":"output","content":"Output one line containing the answer to the task. Your answer will be considered correct if the absolute or relative error is at most $10^(-6)$."},{"iden":"examples","content":"Input0 0 1 0\n2 0 2 1\nOutput1.414213562373\nInput-2 -4 -2 -2\n-3 -5 -3 -2\nOutput1.000000000000\n"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ S \\in \\mathbb{S} $ be the input string representing the elephant's speech.  \nLet $ N \\in \\mathbb{Z} $ be the number of ASCII art lines, with $ 1 \\leq N \\leq 50 $.  \nLet $ A = (a_1, a_2, \\dots, a_N) $ be a sequence of strings, where each $ a_i \\in \\mathbb{S} $ is a line of ASCII art.\n\n**Constraints**  \n1. $ 1 \\leq N \\leq 50 $  \n2. Each string in $ A $ is non-empty and represents a line of ASCII art.\n\n**Objective**  \nOutput $ S $ followed by a newline, then output each $ a_i $ for $ i = 1 $ to $ N $ in order.","simple_statement":"Print the elephant's words, then print the elephant's ASCII art line by line.","has_page_source":false}