#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

int main(){
	int n;
	while(cin>>n,n){
		int c;
		double h,w;
		vector<pair<double,int> >data;
		data.clear();
		for(int i =0;i <n;i++){
			cin>>c>>h>>w;
			double bmi =(w/((h/100)*(h/100)));
			bmi =fabs(22.0-bmi);
			//cout <<bmi<<endl;
			data.push_back(mp(bmi,-c));
		}
		sort(data.begin(),data.end());
		//cout <<data[0].first<<endl;
		cout <<-data[0].second<<endl;
	}
	return 0;
}