Problem: There are N lines in the xy-plane. The i-th line is represented by A_ix+B_iy=C_i. Any two lines among the N+2 lines, the above N lines plus the x-axis and y-axis, cross each other at exactly one point.

For each pair 1 \leq i < j \leq N, there is a car at the cross point of the i-th and j-th lines. Even where three or more lines intersect at a point, a car is individually placed for each pair of lines. That is, there will be k(k-1)/2 cars placed at the intersection of k lines.

Those cars are already very old, and can only be moved parallel to the x-axis or y-axis.

Takahashi will hold an exhibition of antique cars at a place on the xy-plane. In order to avoid damaging the half-broken cars too much, he will select the place of the exhibition so that the total distance covered will be minimized when all the cars are moved to the place. If such a place is not uniquely determined, among the places that satisfy the condition above, the place with the minimum x-coordinate will be selected. If the place is still not uniquely determined, among the places that satisfy the two conditions above, the place with the minimum y-coordinate will be selected.

Find the place of the exhibition that will be selected.

Constraints

* 2 \leq N \leq 4 × 10^4
* 1 \leq |A_i|,|B_i| \leq 10^4(1 \leq i \leq N)
* 0 \leq |C_i| \leq 10^4(1 \leq i \leq N)
* No two given lines are parallel.
* All input values are integers.

Inputs

Input is given from Standard Input in the following format:


N
A_1 B_1 C_1
:
A_N B_N C_N


Outputs

Print the x-coordinate and y-coordinate of the place of the exhibition that will be selected, in this order, with a space in between. The output will be judged as correct when the absolute or relative error is at most 10^{-9}.

Examples

Input

3
1 1 1
2 -1 2
-1 2 2


Output

1.000000000000000 1.000000000000000


Input

4
1 1 2
1 -1 0
3 -1 -2
1 -3 4


Output

-1.000000000000000 -1.000000000000000


Input

7
1 7 8
-2 4 9
3 -8 -5
9 2 -14
6 7 5
-8 -9 3
3 8 10


Output

-1.722222222222222 1.325000000000000

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;

public class Main {
	
	class Point {
		double x, y;

		public Point(double x, double y) {
			super();
			this.x = x;
			this.y = y;
		}
	}
	
	class Line {
		double a, b, c;

		public Line(double a, double b, double c) {
			super();
			this.a = a;
			this.b = b;
			this.c = c;
		}
		Point intersect(Line other) {
			double d = a * other.b - b * other.a;
			double dx = b * other.c - c * other.b;
			double dy = c * other.a - a * other.c;
			return new Point(dx / d, dy / d);
		}
		@Override
		public String toString() {
			return "Line [a=" + a + ", b=" + b + ", c=" + c + "]";
		}
		
		
	}

	void solve() {
		int n = in.nextInt();
		Line[] lines = new Line[n];
		for (int i = 0; i < n; i++) {
			lines[i] = new Line(in.nextDouble(), in.nextDouble(), -in.nextDouble());
		}
		
		double x = find(lines);
		for (int i = 0; i < n; i++) {
			double tmp = lines[i].a;
			lines[i].a = lines[i].b;
			lines[i].b = tmp;
		}
		double y = find(lines);
		out.println(x + " " + y);
	}

	class Pair implements Comparable<Pair> {
		double val;
		int id;
		public Pair(double val, int id) {
			super();
			this.val = val;
			this.id = id;
		}
		@Override
		public int compareTo(Pair o) {
			return Double.compare(val, o.val);
		}
		@Override
		public String toString() {
			return "Pair [val=" + val + ", id=" + id + "]";
		}
		
	}
	double find(Line[] lines) {
		int n =lines.length;
		double left = -1e10, right = 1e10;
		Pair[] p = new Pair[n];
		for (int i = 0; i < n; i++) {
			p[i] = new Pair(0, 0);
		}
		fill(p, lines, left);
		Line[] l = new Line[n];
		for (int i = 0; i < n; i++) {
			l[i] = lines[p[i].id];
		}
		lines = l;
		BIT tree = new BIT(n);
		for (int IT = 0; IT < 100; IT++) {
			double mid = (left + right) / 2;
			if (mid == left || mid == right) {
				break;
			}
			
			fill(p, lines, mid);
			Arrays.fill(tree.tree, 0);
			long inv = 0;
			for (int i = 0; i < n; i++) {
				inv += i - tree.get(p[i].id - 1);
				tree.add(p[i].id, 1);
			}
			
					
			if (inv * 4 >= 1L * n * (n - 1)) {
				right = mid;
			} else {
				left = mid;
			}
		}
		return (left + right) / 2;
	}
	
	class BIT {
		int[] tree;
		public BIT(int n) {
			tree = new int[n];
		}
		int get(int r) {
			int res  = 0;
			while (r >= 0) {
				res += tree[r];
				r = (r & (r + 1)) - 1;
			}
			return res;
		}
		void add(int pos, int val) {
			while (pos < tree.length) {
				tree[pos] += val;
				pos |= pos + 1;
			}
		}
	}

	private void fill(Pair[] p, Line[] lines, double x) {
		for (int i = 0; i < p.length; i++) {
			p[i].val = (-lines[i].c - lines[i].a * x) / lines[i].b;
			p[i].id = i;
		}
		Arrays.sort(p);
	}

	FastScanner in;
	PrintWriter out;

	void run() {
		in = new FastScanner();
		out = new PrintWriter(System.out);
		solve();
		out.close();
	}

	class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		public FastScanner(String s) {
			try {
				br = new BufferedReader(new FileReader(s));
			} catch (FileNotFoundException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		}

		public String nextToken() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
				}
			}
			return st.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextToken());
		}

		public long nextLong() {
			return Long.parseLong(nextToken());
		}

		public double nextDouble() {
			return Double.parseDouble(nextToken());
		}
	}

	public static void main(String[] args) {
		new Main().run();
	}
}