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 JAVA):

Solution:
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.StringTokenizer;
public class a{
    public static void main(String args[]) throws IOException{
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer(br.readLine());
		Circle c1=new Circle(Integer.parseInt(st.nextToken()),Integer.parseInt(st.nextToken()),Integer.parseInt(st.nextToken()));
		st=new StringTokenizer(br.readLine());
		Circle c2=new Circle(Integer.parseInt(st.nextToken()),Integer.parseInt(st.nextToken()),Integer.parseInt(st.nextToken()));
		st=new StringTokenizer(br.readLine());
		Circle c3=new Circle(Integer.parseInt(st.nextToken()),Integer.parseInt(st.nextToken()),Integer.parseInt(st.nextToken()));
		Point p=null;
		Line l1=null;
		Circle c4=null;
		boolean ans1=false;
		if(c1.r==c2.r){
			ans1=true;
			if(c1.c.y==c2.c.y) l1=new Line((Math.pow(c1.c.x,2)+Math.pow(c1.c.y,2)-Math.pow(c2.c.x,2)-Math.pow(c2.c.y,2))/(2*(c1.c.x-c2.c.x)));
			else if(c1.c.x==c2.c.x) l1=new Line(0,(Math.pow(c1.c.x,2)+Math.pow(c1.c.y,2)-Math.pow(c2.c.x,2)-Math.pow(c2.c.y,2))/(2*(c1.c.y-c2.c.y)),0);
			else l1=new Line((Math.pow(c1.c.x,2)+Math.pow(c1.c.y,2)-Math.pow(c2.c.x,2)-Math.pow(c2.c.y,2))/(2*(c1.c.x-c2.c.x)),0,(c1.c.x-c2.c.x)/(c2.c.y-c1.c.y));
		} else{
			ans1=false;
			double a=(Math.pow(c2.r,2)*c1.c.x-Math.pow(c1.r,2)*c2.c.x)/(Math.pow(c2.r,2)-Math.pow(c1.r,2));
			double b=(Math.pow(c2.r,2)*c1.c.y-Math.pow(c1.r,2)*c2.c.y)/(Math.pow(c2.r,2)-Math.pow(c1.r,2));
			c4=new Circle(a,b,Math.sqrt(Math.pow(a,2)+Math.pow(b,2)-(Math.pow(c2.r,2)*(Math.pow(c1.c.x,2)+Math.pow(c1.c.y,2))-Math.pow(c1.r,2)*Math.pow(c2.c.x,2)-Math.pow(c1.r,2)*Math.pow(c2.c.y,2))/(Math.pow(c2.r,2)-Math.pow(c1.r,2))));
		}
		Line l2=null;
		Circle c5=null;
		boolean ans2=false;
		if(c3.r==c2.r){
			ans2=true;
			if(c3.c.y==c2.c.y) l2=new Line((Math.pow(c3.c.x,2)+Math.pow(c3.c.y,2)-Math.pow(c2.c.x,2)-Math.pow(c2.c.y,2))/(2*(c3.c.x-c2.c.x)));
			else if(c3.c.x==c2.c.x) l2=new Line(0,(Math.pow(c3.c.x,2)+Math.pow(c3.c.y,2)-Math.pow(c2.c.x,2)-Math.pow(c2.c.y,2))/(2*(c3.c.y-c2.c.y)),0);
			else l2=new Line((Math.pow(c3.c.x,2)+Math.pow(c3.c.y,2)-Math.pow(c2.c.x,2)-Math.pow(c2.c.y,2))/(2*(c3.c.x-c2.c.x)),0,(c3.c.x-c2.c.x)/(c2.c.y-c3.c.y));
		} else{
			ans2=false;
			double a=(Math.pow(c2.r,2)*c3.c.x-Math.pow(c3.r,2)*c2.c.x)/(Math.pow(c2.r,2)-Math.pow(c3.r,2));
			double b=(Math.pow(c2.r,2)*c3.c.y-Math.pow(c3.r,2)*c2.c.y)/(Math.pow(c2.r,2)-Math.pow(c3.r,2));
			c5=new Circle(a,b,Math.sqrt(Math.pow(a,2)+Math.pow(b,2)-(Math.pow(c2.r,2)*Math.pow(c3.c.x,2)+Math.pow(c2.r,2)*Math.pow(c3.c.y,2)-Math.pow(c3.r,2)*Math.pow(c2.c.x,2)-Math.pow(c3.r,2)*Math.pow(c2.c.y,2))/(Math.pow(c2.r,2)-Math.pow(c3.r,2))));
		}
		try{
			if(ans1 && ans2){
				p=l1.intersect(l2);
			}
			else if(ans1 && !ans2){
				p=best(c5.intersect(l1),c1);
			}
			else if(!ans1 && ans2){
				p=best(c4.intersect(l2),c1);
			}
			else{
				p=best(c5.intersect(c4),c1);
			}
		} catch(Exception e){
		}
		if(p!=null) System.out.println(p.x+" "+p.y);
    }
	static Point best(Point[] yo,Circle c){
		if(Math.pow(yo[0].x-c.c.x,2)+Math.pow(yo[0].y-c.c.y,2) < Math.pow(yo[1].x-c.c.x,2)+Math.pow(yo[1].y-c.c.y,2)) return yo[0];
		else return yo[1];
	}
}
class Point{
	double x=0;
	double y=0;
	public Point(double x1,double y1){
		x=x1;y=y1;
	}
	public double dist(Point p){
		return Math.sqrt(Math.pow(x-p.x,2)+Math.pow(y-p.y,2));
	}
	public void print(){
		System.out.println("("+x+","+y+")");
	}
}
class Line{
	Point p;
	double m=0;
	boolean vertical=false;
	public Line(double x,double y,double slope){
		m=slope;p=new Point(x,y);
	}
	public Line(double a){
		vertical=true;
		p=new Point(a,0);
	}
	public Point intersect(Line l) throws ParallelLines,CoincidentLines{
		Point ans=new Point(0,0);
		if(l.vertical){
			if(vertical && p.x==l.p.x) throw new CoincidentLines();
			else if(vertical && p.x!=l.p.x) throw new ParallelLines();
			else return new Point(l.p.x,m*(l.p.x -p.x)+p.y);
		} else{
			if(vertical) return new Point(p.x,l.p.y+l.m*(p.x-l.p.x));
			else{
				if(m==l.m && l.p.x==p.x && l.p.y==p.y) throw new CoincidentLines();
				else if(m==l.m && (l.p.x!=p.x || l.p.y!=p.y)) throw new ParallelLines();
				else return new Point(((l.p.y-p.y)+(m*p.x-l.m*l.p.x))/(m-l.m),(m*l.p.y - l.m*p.y + m*l.m*(p.x-l.p.x))/(m-l.m));
			}
		}
	}
	public void print(){
		if(vertical) System.out.println("x="+p.x);
		else if(m==0) System.out.println("y="+p.y);
		else System.out.println("y-"+(p.y<0?("("+p.y+")"):p.y)+"="+(m<0?("("+m+")"):m)+"*(x-"+(p.x<0?("("+p.x+")"):p.x)+")");
	}
}
class Circle{
	Point c;
	double r;
	public Circle(double x,double y,double radius){
		c=new Point(x,y);r=radius;
	}
	public Point[] intersect(Circle cr) throws IdenticalCircles,NonIntersectingCircles,ConcentricCircles{
		if(c.dist(cr.c)>(r+cr.r)) throw new NonIntersectingCircles();
		else if(c.dist(cr.c)<Math.abs(r-cr.r)) throw new NonIntersectingCircles();
		else if(cr.c.x==c.x && cr.c.y==c.y && cr.r==r) throw new IdenticalCircles();
		else if(cr.c.x==c.x && cr.c.y==c.y && cr.r!=r) throw new ConcentricCircles();
		else{
			Line l;
			if(c.y==cr.c.y){
				double root1=(Math.pow(c.x,2)+Math.pow(c.y,2)-Math.pow(r,2)-Math.pow(cr.c.x,2)-Math.pow(cr.c.y,2)+Math.pow(cr.r,2))/(2*(c.x-cr.c.x));
				l=new Line(root1);
			} else{
				double m=-(c.x-cr.c.x)/(c.y-cr.c.y);
				double c1=(Math.pow(c.x,2)+Math.pow(c.y,2)-Math.pow(r,2)-Math.pow(cr.c.x,2)-Math.pow(cr.c.y,2)+Math.pow(cr.r,2))/(2*(c.y-cr.c.y));
				if(m==0) l=new Line(0,c1,0);
				else l=new Line(-c1/m,0,m);
			}
			Point[] ans=new Point[2];
			ans[0]=new Point(0,0);
			ans[1]=new Point(0,0);
			try{
				ans=intersect(l);
			} catch(NonIntersectingCircleAndLine e){
				e.printStackTrace();
			}
			return ans;
		}
	}
	public Point[] intersect(Line l) throws NonIntersectingCircleAndLine{
		Point[] temp=new Point[2];
		if(l.vertical){
			double b=-2*c.y;
			double c1=Math.pow(c.x,2)+Math.pow(c.y,2)-Math.pow(r,2)+Math.pow(l.p.x,2)-2*l.p.x*c.x;
			double D=Math.pow(b,2)-4*c1;
			if(D<0.0) throw new NonIntersectingCircleAndLine();
			else{
				double rootD=Math.sqrt(D);
				temp[0]=new Point(l.p.x,(-b+rootD)/(2));
				temp[1]=new Point(l.p.x,(-b-rootD)/(2));	
			}
		} else if(l.m==0){
			double b=-2*c.x;
			double c1=Math.pow(c.x,2)+Math.pow(c.y,2)-Math.pow(r,2)+Math.pow(l.p.y,2)-2*l.p.y*c.y;
			double D=Math.pow(b,2)-4*c1;
			if(D<0.0) throw new NonIntersectingCircleAndLine();
			else{
				double rootD=Math.sqrt(D);
				temp[0]=new Point((-b+rootD)/(2),l.p.y);
				temp[1]=new Point((-b-rootD)/(2),l.p.y);
			}
		} else{
			double a=1+Math.pow(l.m,2);
			double c1=-l.m*l.p.x;
			double b=2*l.m*c1-2*c.x-2*l.m*c.y;
			double cy=Math.pow(c1,2)-2*c1*c.y+Math.pow(c.x,2)+Math.pow(c.y,2)-Math.pow(r,2);
			double D=Math.pow(b,2)-4*a*cy;
			if(D<0.0) throw new NonIntersectingCircleAndLine();
			else{
				double rootD=Math.sqrt(D);
				temp[0]=new Point((-b+rootD)/(2*a),(l.m*(-b+rootD)/(2*a))+c1);
				temp[1]=new Point((-b-rootD)/(2*a),(l.m*(-b-rootD)/(2*a))+c1);
			}
		}
		return temp;
	}
	public void print(){
		System.out.println("(x-"+(c.x<0?("("+c.x+")"):c.x)+")^2 + (y-"+(c.y<0?("("+c.y+")"):c.y)+")^2 = ("+r+")^2");
	}
}
class ParallelLines extends Exception{}
class CoincidentLines extends Exception{}
class IdenticalCircles extends Exception{}
class ConcentricCircles extends Exception{}
class NonIntersectingCircles extends Exception{}
class NonIntersectingCircleAndLine extends Exception{}