using System;
using System.Linq;
using System.Collections.Generic;
using System.Diagnostics;
using Debug = System.Diagnostics.Trace;
using SB = System.Text.StringBuilder;
using System.Numerics;
using static System.Math;
using Number = System.Int32;

namespace Program {
	public class Solver {
		Random rnd = new Random();
		public void Solve() {
			var n = ri;
			var L = Enumerate(n, x => new int[] { ri, ri, ri });
			var ans = new List<double>();
			for (int T = 0; T < 2; T++) {
				for (int i = 0; i < n; i++) if (L[i][1] < 0) {
						L[i][0] *= -1;
						L[i][1] *= -1;
						L[i][2] *= -1;
					}
				Array.Sort(L, (u, v) => (-1.0 * u[0] / u[1]).CompareTo(-1.0 * v[0] / v[1]));
				foreach (var x in L)
					Debug.WriteLine(x.AsJoinedString());
				var l = -1e9; var r = 1e9;
				for (int _ = 0; _ < 100; _++) {
					var pos = (l + r) / 2;
					var p = new double[n];
					var id = new int[n];
					for (int i = 0; i < n; i++) {
						p[i] = (L[i][2] - L[i][0] * pos) / L[i][1];
						id[i] = i;
					}
					//Debug.WriteLine("points");
					//Debug.WriteLine(p.AsJoinedString());
					//Debug.WriteLine(id.AsJoinedString());
					var fenwick = new FenwickTree(n);
					var cnt = 0L;
					foreach (var x in id.OrderBy(x => p[x]).ThenBy(x => x)) {
						// Debug.WriteLine(fenwick.Items.AsJoinedString());
						cnt += fenwick[x + 1];
						fenwick.Add(x + 1, 1);
					}
					// Debug.WriteLine(cnt);
					if (cnt * 2 >= n * (n - 1) / 2) r = pos;
					else l = pos;
				}
				ans.Add(r);
				for (int i = 0; i < n; i++) Swap(ref L[i][0], ref L[i][1]);
			}
			Console.WriteLine(ans.AsJoinedString());
		}
		const long INF = 1L << 60;
		static int[] dx = { -1, 0, 1, 0 };
		static int[] dy = { 0, 1, 0, -1 };
		int ri { get { return sc.Integer(); } }
		long rl { get { return sc.Long(); } }
		double rd { get { return sc.Double(); } }
		string rs { get { return sc.Scan(); } }
		public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());

		static T[] Enumerate<T>(int n, Func<int, T> f) {
			var a = new T[n];
			for (int i = 0; i < a.Length; ++i) a[i] = f(i);
			return a;
		}
		static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
	}
}

#region main
static class Ex {
	static public string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); }
	static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
		return string.Join(st, ie);
	}
	static public void Main() {
		Console.SetOut(new Program.IO.Printer(Console.OpenStandardOutput()) { AutoFlush = true });
		var solver = new Program.Solver();
		/* 
		var t = new System.Threading.Thread(solver.Solve, 50000000);
		t.Start();
		t.Join();
		*/
		solver.Solve();
		Console.Out.Flush();
	}
}
#endregion
#region Ex
namespace Program.IO {
	using System.IO;
	using System.Text;
	using System.Globalization;

	public class Printer : StreamWriter {
		public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
		public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
	}

	public class StreamScanner {
		public StreamScanner(Stream stream) { str = stream; }

		public readonly Stream str;
		private readonly byte[] buf = new byte[1024];
		private int len, ptr;
		public bool isEof = false;
		public bool IsEndOfStream { get { return isEof; } }

		private byte read() {
			if (isEof) return 0;
			if (ptr >= len) {
				ptr = 0;
				if ((len = str.Read(buf, 0, 1024)) <= 0) {
					isEof = true;
					return 0;
				}
			}
			return buf[ptr++];
		}

		public char Char() {
			byte b = 0;
			do b = read(); while ((b < 33 || 126 < b) && !isEof);
			return (char)b;
		}
		public string Scan() {
			var sb = new StringBuilder();
			for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b);
			return sb.ToString();
		}
		public string ScanLine() {
			var sb = new StringBuilder();
			for (var b = Char(); b != '\n' && b != 0; b = (char)read()) if (b != '\r') sb.Append(b);
			return sb.ToString();
		}
		public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
		public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
		public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
	}
}

#endregion

#region Fenwick
public class FenwickTree {
	int n;
	Number[] bit;
	int max = 1;
	public FenwickTree(int size) {
		n = size; bit = new Number[n + 1];
		while ((max << 1) <= n) max <<= 1;
	}
	/// <summary>sum[a,b]</summary>
	public Number this[int i, int j] { get { return this[j] - this[i - 1]; } }
	/// <summary>sum[0,i]</summary>
	public Number this[int i] { get { Number s = 0; for (; i > 0; i -= i & -i) s += bit[i]; return s; } }
	public int LowerBound(Number w) {
		if (w <= 0) return 0;
		int x = 0;
		for (int k = max; k > 0; k >>= 1)
			if (x + k <= n && bit[x + k] < w) {
				w -= bit[x + k];
				x += k;
			}
		return x + 1;
	}
	/// <summary>add v to bit[i]</summary>
	public void Add(int i, Number v) {
		if (i == 0) System.Diagnostics.Debug.Fail("BIT is 1 indexed");
		for (; i <= n; i += i & -i) bit[i] += v;
	}
	public Number[] Items {
		get {
			var ret = new Number[n + 1];
			for (int i = 0; i < ret.Length; i++)
				ret[i] = this[i, i];
			return ret;
		}
	}
}
#endregion


Measured memory_bytes: 39840