#include <iostream>
#include <deque>
using namespace std;
int main()
{
	deque<int> m;
	deque<double> d, h, w;
	int n, i, t[3];
	double u;
	while (cin >> n && n)
	{
		u = 0;
		m.clear();
		h.clear();
		w.clear();
		d.clear();
		for (i = 0; i < n; i++)
		{
			cin >> t[0] >> t[1] >> t[2];
			m.push_back(t[0]);
			h.push_back((double)t[1]/100);
			w.push_back((double)t[2]);
			d.push_back(22.0 - w[i]/(h[i]*h[i]));
			if (i == 0) u = abs(d[0]);
			if (abs(d[i]) < u) u = abs(d[i]);
		}
		for (i = 0; i < n; i++)
		{
			if (u == abs(d[i]))
				cout << m[i] << endl;
		}
	}
}