Goats in the Orchard - 4#2722

Goats in the Orchard - 4

1 second
64 megabytes
Easy

Two goats are tied with ropes to their own pegs in the orchard. Each goat can move in a circle, stretching its rope to the maximum length. Find all the points where they can meet.

Input

The first two lines contain three integers each: the coordinates of the peg to which each goat is tied, and the length of the rope. All numbers are integers with absolute values not exceeding , and rope lengths are positive.

Output

The first line of the output file should contain the number of intersection points (, , , or if there are infinitely many). In the case of one intersection point, output the coordinates of this point on the second line.

In the case of two intersection points, output the coordinates of the two points in lexicographical order (that is, output first the point with the smaller -coordinate; if the -coordinates are equal, output the point with the smaller -coordinate). All numbers must be displayed with at least decimal places of precision.

Examples

Example 1

Loading
Loading