Problem: The Olympic Games in Bercouver are in full swing now. Here everyone has their own objectives: sportsmen compete for medals, and sport commentators compete for more convenient positions to give a running commentary. Today the main sport events take place at three round stadiums, and the commentator's objective is to choose the best point of observation, that is to say the point from where all the three stadiums can be observed. As all the sport competitions are of the same importance, the stadiums should be observed at the same angle. If the number of points meeting the conditions is more than one, the point with the maximum angle of observation is prefered. 

Would you, please, help the famous Berland commentator G. Berniev to find the best point of observation. It should be noted, that the stadiums do not hide each other, the commentator can easily see one stadium through the other.

Input

The input data consists of three lines, each of them describes the position of one stadium. The lines have the format x, y, r, where (x, y) are the coordinates of the stadium's center ( - 103 ≤ x, y ≤ 103), and r (1 ≤ r ≤ 103) is its radius. All the numbers in the input data are integer, stadiums do not have common points, and their centers are not on the same line. 

Output

Print the coordinates of the required point with five digits after the decimal point. If there is no answer meeting the conditions, the program shouldn't print anything. The output data should be left blank.

Examples

Input

0 0 10
60 0 10
30 30 10


Output

30.00000 0.00000

Solution (in PYTHON3):

Solution:
import math,sys,re,itertools,pprint,collections,copy
ri,rai=lambda:int(input()),lambda:list(map(int, input().split()))

eps = 1e-5

def all_less_eps(*args):
    for x in args:
        if abs(x) > eps:
            return False
    return True

class Point:
    def __init__(self, x, y):
        self.x = x
        self.y = y
    def __add__(self, other):
        return Point(self.x + other.x, self.y + other.y)
    def __sub__(self, other):
        return Point(self.x - other.x, self.y - other.y)
    def len(self):
        return math.sqrt(self.x**2 + self.y**2)
    def __rmul__(self, scalar):
        return Point(scalar*self.x, scalar*self.y)
    def normalize(self):
        return (1/self.len()) * self
    def __str__(self):
        return "({}, {})".format(self.x, self.y)
    def __repr__(self):
        return "({}, {})".format(self.x, self.y)
    def dist_to(self, o): # o -- Point or Line
        if isinstance(o, Point):
            return (o - self).len()
        if isinstance(o, Line):
            l = line_by_point_and_direction(self, o.norm())
            x = o.intersect(l)
            return self.dist_to(x)
    def center(self, o): # o -- Point or Line
        if isinstance(o, Point):
            return Point((self.x + o.x)/2, (self.y + o.y)/2)
        if isinstance(o, Line):
            l = line_by_point_and_direction(self, o.norm())
            x = o.intersect(l)
            return self.center(x)
    def midle_perpendicular(self, b):
        c = self.center(b)
        n = Point(self.x - b.x, self.y - b.y)
        return line_by_point_and_normal(c, n)
    def __neg__(self):
        return Point(-self.x, -self.y)
    def __eq__(self, o):
        return all_less_eps(self.x - o.x, self.y - o.y)

class Circle:
    def __init__(self, x, y, r):
        self.x = x
        self.y = y
        self.r = r
    def __str__(self):
        return "Circle({}, {}, {})".format(self.x, self.y, self.r)
    def center(self):
        return Point(self.x, self.y)
    def move(self, p): # p -- Point
        return Circle(self.x + p.x, self.y + p.y, self.r)
    def intersect(self, o): # o -- Line or Circle
        if isinstance(o, Line):
            return o.intersect(self)
        if isinstance(o, Circle):
            o1, o2 = self, o
            l = Line(2*(o2.x - o1.x), 2*(o2.y - o1.y), o1.x**2 - o2.x**2 + o1.y**2 - o2.y**2 - o1.r**2 + o2.r**2)
            return l.intersect(o1)
    def __eq__(self, o):
        return all_less_eps(self.x - o.x, self.y - o.y, self.r - o.r)
    def angle_vision_from(self, p: Point):
        return 2 * math.atan(self.r / p.dist_to(self.center()))

class Line:
    def __init__(self, a, b, c):
        self.a = a
        self.b = b
        self.c = c
    def __str__(self):
        return "Line({}, {}, {})".format(self.a, self.b, self.c)
    def dir(self):
        return Point(-self.b, self.a)
    def norm(self):
        return Point(self.a, self.b)
    def move(self, p): # p -- Point
        return Line(self.a, self.b, self.a*p.x + self.b*p.y + self.c)
    def intersect(self, o): # o -- Line or Circle
        if isinstance(o, Line):
            x = solve_lineq2([[self.a, self.b], [o.a, o.b]], [-self.c, -o.c])
            if x is None:
                return []
            return [Point(x[0], x[1])]
        if isinstance(o, Circle):
            l = self
            if abs(l.a) < eps: # l.a == 0
                y = -l.c/l.b
                xx = solve_sqeq(1, -2*o.x, o.x**2 + (y - o.y)**2 - o.r**2)
                return [Point(x, y) for x in xx]
            a = l.a**2 + l.b**2
            b = 2*(l.b*l.c + l.a*l.b*o.x - l.a**2*o.y)
            c = l.c**2 + 2*l.a*l.c*o.x + l.a**2*o.x**2 + l.a**2*o.y**2 - o.r**2*l.a**2
            yy = solve_sqeq(a, b, c)
            # print(a, b, c)
            # print(l, o)
            # print("yy", yy)
            return [Point( (-l.b*y - l.c)/l.a  , y) for y in yy]

    def __eq__(self, o):
        return all_less_eps(self.a - o.a, self.b - o.b, self.c - o.c)

def line_by_2_points(a, b):
    return line_by_point_and_direction(a, b-a)

def line_by_point_and_direction(M, p):
    return Line(p.y, -p.x, p.x*M.y - p.y*M.x)

def line_by_point_and_normal(p, n):
    return line_by_point_and_direction(p, Point(-n.y, n.x))

def det2(a): # determinate of 2x2 matrix
    return a[0][0]*a[1][1] - a[0][1]*a[1][0]

def solve_sqeq(a, b, c):
    if abs(a) < eps:
        return [-c/b]
    D = b**2 - 4*a*c
    if abs(D) < eps: # D == 0
        return [-b/(2*a)]
    if D < 0:
        return []
    x1 = (-b + math.sqrt(D)) / (2*a)
    x2 = (-b - math.sqrt(D)) / (2*a)
    return [x1, x2]

def solve_lineq2(a: list, b: list):
    detA = det2(a)
    if abs(detA) < eps:
        return None
    x = [None] * 2
    t = copy.deepcopy(a)
    t[0][0], t[1][0] = b[0], b[1]
    x[0] = det2(t) / detA
    t = copy.deepcopy(a)
    t[0][1], t[1][1] = b[0], b[1]
    x[1] = det2(t) / detA
    return x

def solve_for_2_circle(c1: Circle, c2: Circle):
    A = c1.center()
    B = c2.center()
    if c1.r == c2.r:
        return A.midle_perpendicular(B)
    else:
        e = (B - A).normalize()
        a = c1.r / c2.r
        l = A.dist_to(B)
        x1 = a * l / (1 + a)
        x2 = a * l / (a - 1)
        H1 = A + x1 * e
        H2 = A + x2 * e
        H = H1.center(H2)
        return Circle(H.x, H.y, H.dist_to(H1))

# Point Class Testing:
# p1 = Point(1, 1)
# p2 = Point(2, 3)
# print(p1, p2, -p1, -p2, -2*p1)
# print(p1 + p2)
# print(p2 - p1)
# print(p1.len())
# print(2 * p1, 1/2 * p2)
# print(p1.normalize())
# n = p2.normalize()
# print(n, n.len())

# sqeq Testing:
# print(solve_sqeq(2, 1, -1))
# print("-" * 80)

# Intersect Testing:
# l = Line(-3, 2, 0)
# c = Circle(4, 3, 3)
# print(l, c)
# print(l.intersect(c))
# print("-" * 80)

c1, c2, c3 = Circle(*rai()), Circle(*rai()), Circle(*rai())

o1 = solve_for_2_circle(c1, c2)
o2 = solve_for_2_circle(c1, c3)
ans = o1.intersect(o2)

# print(c1, c2, c3)
# print(o1)
# print(o2)
# print(ans)

if len(ans) == 2:
    a, b = ans
    a1, a2 = c1.angle_vision_from(a), c1.angle_vision_from(b)
    # print(a1, a2)
    if a1 > a2:
        print(a.x, a.y)
    else:
        print(b.x, b.y)
elif len(ans) == 1:
    a = ans[0]
    print(a.x, a.y)