#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int n;
    while(cin >> n, n){
        vector<pair<double, int>> v;
        for (int i = 0; i < n; ++i) {
            int p; int h, w;
            cin >> p >> h >> w;
            v.emplace_back(abs(22-1e4*w/h/h), p);
        }
        cout << min_element(v.begin(),v.end())->second << "\n";

    }
    return 0;
}
