Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var sc = bufio.NewScanner(os.Stdin)

// func read() string {
// 	sc.Scan()
// 	return sc.Text()
// }

func main() {
	sc.Split(bufio.ScanLines)
	for sc.Scan() {
		n := strings.Split(sc.Text(), ",")
		id, _ := strconv.Atoi(n[0])
		weight, _ := strconv.ParseFloat(n[1], 64)
		height, _ := strconv.ParseFloat(n[2], 64)
		bmi := weight / (height * height)
		if bmi >= 25.0 {
			fmt.Println(id)
		}
	}
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;

#define F first
#define S second
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define sz size()
#define all(A)    A.begin(), A.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define f0(i,b)   for(int i=0;i<(b);i++)
#define f1(i,b)   for(int i=1;i<=(b);i++)
#define f2(i,a,b) for(int i=(a);i<=(b);i++)
#define fr(i,b,a) for(int i=(b);i>=(a);i--)
#define rep(i,a,b,c) for(int i=(a);i!=(b);i+=(c))
#define mod 1000000007

#define forr(i,n)    for(i=0; i<n; i++)
#define whilee(i,t)  while(i!=t)
#define  sl(a)  scanf("%lld",&a)
#define  pl(a)  printf("%lld",a)

//for(auto it =A.begin(); it!=A.end(); it++)
//sort(A.begin(),A.end());
//binary_search(A.begin(),A.end(),x);
//reverse(A.begin(), A.end());
//cout << *max_element(A.begin(), A.end());
//cout << *min_element(A.begin(), A.end());
//count(A.begin(), A.end(), X); //counts the occurrences of X
//distance(A.begin(),A.end());  //distance between first to last element
//accumulate(A.begin(), A.end(), 0); //add
//next_permutation(A.begin(), A.end());
//prev_permutation(A.begin(), A.end());
//swap(S[0], T[0]);
//scanf("%d",&x);
//printf("%d\n",x);

//vector <int> A;
//deque <int> A;
//queue <int> A;
//stack <int> A;
//set <int> A;
//map <int,int> A;
//pair <int,int> A ;
//vector <pair <int,int>> A ;
char ch;
//string S, T, U;
ll i, j, k, a, b, c, d, f, g,  l, m, n, p, q, r,  t,  y, z, maxx=INT_MIN, minn=INT_MAX, ans=0, sum=0, cnt=0;
double w,h, x;
int s;
int main()
{
    //ios_base::sync_with_stdio(false);
    //cin.tie(nullptr);
    //cout.tie(nullptr);

    while(cin>>s>>ch>>w>>ch>>h)
    {
          if(w/(h*h)>=25.00)
          {
              printf("%d\n", s);
          }
    }

    return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <iostream>
#include <climits>
#include <cfloat>

using namespace std;

int main()
{
	int n;
	double w, h;
	while (scanf("%d,%lf,%lf\n", &n, &w, &h) != EOF)
	{
		if (w/(h*h) >= 25)
			printf("%d\n", n);
	}

	return 0;
}

C++: #include <cstdio>
#include <vector>
#include <map>
using namespace std;

double IMB(double w,double t){
	return w/t*t;
}

int main(){
	int No;
	double w,t;
	vector<int> vc;
	map<int,double> f;

	while( ~scanf("%d,%lf,%lf", &No , &w , &t ) ){
		//printf("%d %f %f\n" , No , w , t );
		//if( No == -1 ) break;
		vc.push_back( No );
		f[ No ] = IMB( w, t );
	}
	for(int i=0 ; i<vc.size() ; ++i )
		if( f[ vc[i] ] >= 25.0 )
			printf("%d\n", i );
}

C++: #include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
int main(){
	vector<int> BMI;
	for(;;){
		int num;
		double m,l;
		if(scanf("%d,%lf,%lf",&num,&m,&l) == EOF){break;}
		if(m/(l*l) > 25){BMI.push_back(num);}
	}
	for(int i=0; i<BMI.size(); i++){
		cout <<BMI[i]<<endl;
	}
}

C++: #include<iostream>
using namespace std;

int main(){
    double i,w,h,f=0;
    char c;
    while(cin>>i>>c>>w>>c>>h){
        if(w/h/h>=25){
            f=1;
            cout<<i<<endl;
        }
    }
    if(!f)cout<<"????????????"<<endl;
}

C++: #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;
}

C++: #include <iostream>
#include <stdlib.h>
#include <math.h>
using namespace std;

int main() {
double h,w,bmi;
int n;
char a,b;
while(cin>>n>>a>>w>>b>>h){
	bmi=w/(h*h);
	if(bmi>=25){
		cout<<n<<endl;
	}
}
	return 0;
}

C++: #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typedef long long ll;
typedef unsigned long long ull;

int main()
{
    int s;
    double w, h;
    char dot;
    while (cin >> s >> dot >> w >> dot >> h)
    {
        double bmi = w / (h * h);
        if (bmi >= 25)
            OP(s);
    }
    return 0;
}

C++: #include <cstdio> 
#include <iostream> 
 
using namespace std; 
 
int main(void) 
{ 
  int a; 
  double b, c; 
  int kiken[100]; 
 
  while (scanf("%d,%lf,%lf", &a, &b, &c)){ 
    int d = 0; 
    d = c / (b * b); 
    if (d <= 25){ 
      cout << a << endl; 
    } 
  } 
 
  return (0); 
}

C++: #include<stdio.h>

int main(){
	int l;
	double m,n;
	while(scanf("%d,%lf,%lf",&l,&m,&n)){
		if(25.0<=m/(n*n))printf("%d\n",l);
		else printf("????????????\n");
	}
		return 0;
}

C++: #include <iostream>
#include <cmath>
using namespace std;

int main(void)
{
  double bmi;
  double height, weight;
  int num;
  int over_num[100];
  int i=0;
  char c, d;

  while(cin >> num >> c >> weight >> c >> height)
    {
      bmi = weight / (height * height);
      if(bmi >= 25.0) 
	{
	  over_num[i] = num;
	  i++;
	}
    }
  for(int j = 0 ; j < i ; j++)
    {
      cout << over_num[j] << endl;
    }
  return 0;
}

C++: #include <cstdio> 
#include <iostream> 
 
using namespace std; 
 
int main(void) 
{ 
  int a; 
  double b, c; 
 
  while (scanf("%d,%lf,%lf", &a, &b, &c) != EOF){ 
    int d = 0; 
    d = b / (c * c); 
    if (d >= 25.00){ 
      cout << a << endl; 
    } 
  } 
 
  return (0); 
}

C++: #include<stdio.h>

int main(){
	int n;
	double w,l;
	while(~scanf("%d,%lf,%lf",&n,&w,&l)){
		if(w/l/l>=25.0)printf("%d\n",n);
	}
}

C++: #include <iostream>


using namespace std;
int num,i=0;
double m,kg;
int main(void){
	while(~scanf("%d,%lf,%lf",&num,&kg,&m)){
		if(kg/(pow(m,2))>=25)printf("%d\n",num);
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <sstream>
#include <vector>
#include <string>
#include <iomanip>
#include <bitset>
using namespace std;
#define INF	100000000
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define fi first
#define sec second
#define lb lower_bound
#define ub upper_bound
#define SS stringstream
#define rep(i,n) for(int i = 0; i < n; i++)
#define sz(x) ((int)(x).size())
#define SORT(x) sort((x).begin(), (x).end())
#define RSORT(x) sort((x).begin(), (x).end(), greater<int>() )
#define clr(a,b) memset((a),(b),sizeof(a))
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<P> Vp;
typedef priority_queue<P, vector<P>, greater<P> > PQ;

int num;
double weight,height;
char trash;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	while(cin >> num >> trash >> weight >> trash >> height){
		if(weight >= height*height*25) cout << num << endl;
	}
}