#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
#include <complex>
#include <map>
using namespace std;

#define rep(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second

static const double PI=6*asin(0.5);
typedef pair<int,bool> P;
typedef complex<double> CP;
typedef long long ll;

int main(){
	bool f=false;
	int id;
	double w,h;
	char t;
	while(cin>>id>>t>>w>>t>>h){
		if(25<=w/h/h){
			f=true;
			cout<<id<<endl;
		}
	}
	if(!f) cout<<"該当なし"<<endl;
	return 0;
}