In the garden allowed the two goats, each with a rope tied to your peg. Every kid is moving in a circle, pulling the rope on the maximum length. Find all the points at which they can meet. \InputFile The first two lines are three numbers - the coordinates of the peg, is bound to each goat, and the length of the rope which he tied. All the numbers - integers less than or equal modulo \textbf{10000}, length of rope - are positive. \OutputFile The first line of output file output the number of intersection points (\textbf{0}, \textbf{1}, \textbf{2} or \textbf{3}, if their number is infinite). In the case of one intersection point output in the second row coordinates of the point. In the case of two intersection points of output coordinates of two points in lexicographic order (ie, first output the point at which less coordinate \textbf{x}, and if the coordinates of \textbf{x} are equal, then the point at which the smaller coordinate \textbf{y}). All numbers should be displayed with an accuracy of at least \textbf{6} decimal places.