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


# a * x + b * y + c = 0
def line_through_two_points(x1, y1, x2, y2):
    a = y1 - y2
    b = x2 - x1
    c = x1 * y2 - x2 * y1

    return [a, b, c]


# центр окружности в точке (0, 0)
def circle_and_line_intersection0(r_r, a, b, c):
    a2 = a * a
    b2 = b * b
    a2b2 = a2 + b2
    x0 = -a * c / a2b2
    y0 = -b * c / a2b2
    d2 = r_r - c * c / a2b2

    if d2 < 0:
        return []

    if not d2:
        return [[x0, y0]]

    mult = math.sqrt(d2 / a2b2)

    a_mult = a * mult
    b_mult = b * mult

    x1 = x0 + b_mult
    y1 = y0 - a_mult

    x2 = x0 - b_mult
    y2 = y0 + a_mult

    return [[x1, y1], [x2, y2]]


def circle_and_line_intersection(xc, yc, r_r, a, b, c):
    points = circle_and_line_intersection0(r_r, a, b, c + a * xc + b * yc)

    for point in points:
        point[0] += xc
        point[1] += yc

    return points


# центр первой окружности в точке (0, 0)
def circle_and_circle_intersection0(x2, y2, r1_r1, r2_r2):
    return circle_and_line_intersection0(r1_r1,
                                         -2 * x2,
                                         -2 * y2,
                                         x2 * x2 + y2 * y2 + r1_r1 - r2_r2)


def circle_and_circle_intersection(x1, y1, x2, y2, r1_r1, r2_r2):
    points = circle_and_circle_intersection0(x2 - x1,
                                             y2 - y1,
                                             r1_r1,
                                             r2_r2)

    for point in points:
        point[0] += x1
        point[1] += y1

    return points


def is_point_in_triangle(ax, ay, bx, by, cx, cy, x, y):
    ax -= x
    ay -= y

    bx -= x
    by -= y

    cx -= x
    cy -= y

    ab = ax * by - ay * bx

    if not ab:
        return False

    bc = bx * cy - by * cx

    if not bc:
        return False

    if (ab > 0.) and (bc < 0.):
        return False

    if (ab < 0.) and (bc > 0.):
        return False

    ca = cx * ay - cy * ax

    if not ca:
        return False

    if (ab > 0.) and (ca < 0.):
        return False

    if (ab < 0.) and (ca > 0.):
        return False

    return True

def get_dist2(x1, y1, x2, y2):
    return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)

def get_circ(x1, y1, RR1, x2, y2, RR2):
    xc = (RR2 * x1 - RR1 * x2) / (RR2 - RR1)
    yc = (RR2 * y1 - RR1 * y2) / (RR2 - RR1)

    RR = RR1 * RR2 / ((RR2 - RR1) * (RR2 - RR1))
    RR *= get_dist2(x1, y1, x2, y2)

    return [xc, yc, RR]


Ax, Ay, Ra = map(float, input().split())
Bx, By, Rb = map(float, input().split())
Cx, Cy, Rc = map(float, input().split())

if Ra == Rb and Rb == Rc:
    ax_bx = Ax - Bx
    ay_by = Ay - By

    bx_cx = Bx - Cx
    by_cy = By - Cy

    cx_ax = Cx - Ax
    cy_ay = Cy - Ay

    a2 = bx_cx * bx_cx + by_cy * by_cy
    b2 = cx_ax * cx_ax + cy_ay * cy_ay
    c2 = ax_bx * ax_bx + ay_by * ay_by

    S = abs(ax_bx * by_cy - ay_by * bx_cx) / 2
    coef = -1 / (8 * S * S)

    alpha_a = coef * a2 * (ax_bx * cx_ax + ay_by * cy_ay)
    alpha_b = coef * b2 * (ax_bx * bx_cx + ay_by * by_cy)
    alpha_c = coef * c2 * (cx_ax * bx_cx + cy_ay * by_cy)

    Ux = alpha_a * Ax + alpha_b * Bx + alpha_c * Cx
    Uy = alpha_a * Ay + alpha_b * By + alpha_c * Cy

    print('%.5f %.5f' % (Ux, Uy))
    exit()

RRa = Ra * Ra
RRb = Rb * Rb
RRc = Rc * Rc

circs = []

if Ra != Rb:
    circs.append(get_circ(Ax, Ay, RRa, Bx, By, RRb))

if Rb != Rc:
    circs.append(get_circ(Bx, By, RRb, Cx, Cy, RRc))

if Rc != Ra and len(circs) < 2:
    circs.append(get_circ(Cx, Cy, RRc, Ax, Ay, RRa))

points = circle_and_circle_intersection(circs[0][0], circs[0][1], circs[1][0], circs[1][1], circs[0][2], circs[1][2])

if not points:
    exit()

if len(points) < 2:
    Ux, Uy = points[0]
else:
    dd0 = get_dist2(points[0][0], points[0][1], Ax, Ay)
    dd1 = get_dist2(points[1][0], points[1][1], Ax, Ay)

    Ux, Uy = points[0] if dd0 < dd1 else points[1]

print('%.5f %.5f' % (Ux, Uy))