#include <algorithm>
#include <map>
#include <vector>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <string>
#include <queue>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define IREP(it,array) for(vector<int>::iterator it=array.begin(); it!=array.end(); ++it)
#define SREP(it,array) for(vector<string>::iterator it=array.begin(); it!=array.end(); ++it)


class Student{
public:
  int num;
  double weight;
  double height;
  Student(int n, double w, double h){
    num =n;
    weight = w;
    height = h;
  }
};

int main()
{
  cout.setf(ios::fixed, ios::floatfield);
  cout.precision(6);

  int INF = 1000000;

  vector<Student> data;
  int n;
  double w,h;
  char d;
  while(cin >> n >> d >> w >> d >> h){
    Student d(n,w,h);
    data.push_back(d);
  }

  for(vector<Student>::iterator it=data.begin(); it!=data.end(); ++it){
    double bmi = it->weight / pow(it->height,2);
    if( bmi >= 25 )
      cout << it->num << endl;
  }

  return 0;
}