Let the goat into the garden - 8`
In a city, two goats are each tethered to a stake with a rope, allowing them to move in a circle with the rope fully extended.
Your task is to determine all the points where the goats can meet.
Input
The input consists of two lines, each containing three integers. These represent the coordinates of the stake to which each goat is tied, followed by the length of the rope. All integers are within the range of (-10000) to (10000), and the rope lengths are positive.
Output
On the first line of the output, print the number of intersection points (0, 1, 2, or 3 if there are infinitely many). If there is one intersection point, print its coordinates on the second line. If there are two intersection points, print their coordinates in lexicographical order (i.e., first the point with the smaller x coordinate, and if the x coordinates are the same, then the point with the smaller y coordinate). Ensure all numbers are printed with a precision of at least 6 decimal places.