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 <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cstring>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
using namespace std;
 
#define rep(i,n) for(int i=0; i<n; i++)
#define FOR(i,s,n) for(int i=s; i<n; i++)
#define ALL(x) x.begin(), x.end()
#define pb push_back
#define foreach(it,con) for(auto it=con.begin();it!=con.end();it++)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;

struct Person{
	Person(int _id,int _m,int _h):h(_h),m(_m),id(_id){
	}
	int id;
	float m;
	float h;
	float bmi(){
		return m/h*h;
	}
};

int main(){
		int id;
		float m,h;
	while(scanf("%d,%f,%f",&id,&m,&h)+1){
		Person p(id,m,h);
		if(p.bmi()>=25.0){
			cout << id << endl;
		}
	}
	return 0;	
}

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

inline double bmi(double w, double h) {
  return w / (h*h);
}

int main() {
  string s;
  while(cin >> s) {
    replace(s.begin(), s.end(), ',', ' ');
    stringstream ss(s);
    int id;
    double w, h;
    ss >> id >> w >> h;
    if(bmi(w,h) >= 25) cout << id << endl;
  }
  return 0;
}

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

int main(){
  int num;
  double weight, height;
  char ch;
  while (cin >> num >> ch >> weight >> ch >> height) {
    double bmi = weight / (height * height);
    if (bmi >= 25.0)
    cout << num << endl;
  }
}

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

double BMI(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 ) ){
		if( BMI( w , t ) >= 25.0 )
			printf("%d\n", No );
		//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<cstdlib>
#include<string>
using namespace std;
int main(){
  string a,b,c;
  double d,e,f;
  while(getline(cin,a,',')){
    d=atof(a.c_str());
    getline(cin,b,',');
    e=atof(b.c_str());
    getline(cin,c,'\n');
    f=atof(c.c_str());
    if(e/f/f>=25)
      cout<<d<<endl;
  }
  return 0;
}

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

int id;
double w,h;
char ch;

int main(){
  while(cin>>id>>ch>>w>>ch>>h){
    if(w/h/h>=25.0){
      cout<<id<<endl;
    }
  }
  return 0;
}

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

int main() {
	int num;
	float w,h;
	
	while(scanf("%d,%f,%f",&num,&w,&h)+1)
		if(w/(h*h) >= 25.0)printf("%d\n",num);
}

C++: #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>

using namespace std;

typedef long long ll;
typedef pair<int,int> P;

int main(){
	int a;
	double b,c;
	while(~scanf("%d,%lf,%lf",&a,&b,&c)){
		if(b/(c*c) > 25){
			cout << a << endl;
		}
	}
}

C++: #include<iostream>
#include<math.h>
#include<string>
#include<vector>
#include<algorithm>
#include<queue>
#include<map>
#include<iomanip>
using namespace std;
#define INF 1<<20

struct edge{
	int to;
	int cost;
	edge() {};
	edge(int a, int b) {
		to = a;
		cost = b;
	}
};

struct Node {
	int pos;
	int cost;
	Node() {};
	Node(int a, int b) {
		pos = a;
		cost = b;
	}
	bool operator <(const Node& rhs) const {
		return cost > rhs.cost;
	}
};

void dijkistra(int st, int TO,int V,vector<vector<edge> > graph) {
	priority_queue<Node> q;
	vector<int> d(V);
	for (int i = 0;i < V;i++) {
		d[i] = INF;
	}
	d[st] = 0;
	q.push(Node(st, 0));
	while (!q.empty()) {
		Node s = q.top(); q.pop();
		int pos = s.pos;
		for (int i = 0;i < graph[pos].size();i++) {
			int to = graph[pos][i].to;
			int cost = graph[pos][i].cost;
			if (d[pos] + cost < d[to]) {
				d[to] = d[pos] + cost;
				q.push(Node(to, d[to]));
			}

		}
	}
	cout << d[TO] << endl;
}
int partition(int A[],int p, int r) {
	int x = A[r];
	int i = p - 1;
	for (int j = p;j < r;j++) {
		if (x >= A[j]) {
			i = i + 1;
			swap(A[i], A[j]);
		}
	}
		swap(A[i + 1], A[r]);
		return i + 1;
}
void quicksort(int A[], int p, int r) {
	if (p < r) {
		int q = partition(A, p, r);
		quicksort(A, p, q-1);
		quicksort(A, q + 1, r);
	}
}

int getNumberOfCoin(int C[],int n,int m) {
	int T[50000];
	for (int j = 0;j <= n;j++) {
		T[j] = INF;
	}
	T[0] = 0;
	for (int i = 0;i < m;i++) {
		for (int j = 0;j <= n;j++) {
			if (j - C[i] >=0  ) {
				T[j] = min(T[j], T[j - C[i]] + 1);
			}
		}
	}
	return T[n];
}
int knapsack(int w, int n,int* v,int* ww) {
	int W[101][10001];
		for (int j = 0;j <= w;j++) {
			W[0][j] = 0;
		}
	for (int i = 0;i < n;i++) {
		for (int k = 0;k < n;k++){
			for (int j = 0;j <= w;j++) {
				if (j - ww[k] < 0) {
					W[i + 1][j] = W[i][j];
				}
				if (j - ww[i] >= 0) {
					W[i + 1][j] = max(W[i][j], W[i][j - ww[k]] + v[k]);

				}
			}
		}
	}
	return W[n][w];
}
int fib(int n) {
	vector<int> v(n+1);
	v[0] = 1;
	v[1] = 1;
	for (int i = 2;i < n+1;i++) {
		v[i] = v[i - 2] + v[i - 1];
	}
	return v[n];
}
int isPrime(int x) {
	if (x <= 1) return false;
	if (x>2 && x % 2 == 0) return false;
	for (int i = 2;i <= sqrt(x);i++) {
		if (x%i == 0) {
			return false;
		}
	}
	if (x == 2) return true;
	return true;
}
int main() {
	int num;
	double w, h;
	char cum;
	vector<int> v;
	while(cin>>num >> cum >> w >> cum >> h) {
		double BMI = w / (h*h);
		if (BMI >= 25) v.push_back(num);
	}
	for (int i = 0;i < v.size();i++) {
		cout << v[i] << endl;
	}

	}

C++: #define _CRT_SECURE_NO_WARNINGS
#include"bits/stdc++.h"
#ifdef _DEBUG
#define DBG(n) n
#else
#define DBG(n)
#endif
#define INF         1e9
#define INFLL       1e18
#define EPS         1e-9
#define REP(i,n)    for(ll i=0,i##_len=(n);i<i##_len;++i)
#define REP1(i,n)   for(ll i=1,i##_len=(n);i<=i##_len;++i)
#define REPR(i,n)   for(ll i=(n)-1;i>=0;--i)
#define REPR1(i,n)  for(ll i=(n);i>0;--i)
#define REPC(i,obj) for(auto i:obj)
#define ALL(obj)    (obj).begin(),(obj).end()
#define SETP(n)     cout << fixed << setprecision(n)
using namespace std;
using ll = long long;
template<typename T = ll>inline T in() { T ret; cin >> ret; return ret; }

signed main()
{
	ll s;
	double w, h;
	while (scanf("%lld,%lf,%lf", &s, &w, &h) != EOF) {
		if (w >= 25 * h * h)cout << s << endl;
	}
}

C++: //whose bmi is more than or equal to 25
#include<iostream>
using namespace std;
int main() {
    int s; double w, h; //s is identity number
    char c1, c2;
    while (cin >> s >> c1 >> w >> c2 >> h) {
        //cout << w / h / h << endl;
        if (w / h / h >= 25) {
            cout << s << endl;
        }
    }
}

C++: #include<functional>
#include<algorithm>
#include<iostream>
#include<utility>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<deque>
#include<map>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,x,n) for(int i=x;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define pf push_front
#define pb push_back
#define int long long
using namespace std;
const int INF=1000000007;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

signed main(){
  int s;
  double w,h;
  char t;
  
  while(cin>>s>>t>>w>>t>>h){
    double BMI=w/(h*h);
    if(BMI>=25){
      cout<<s<<endl;
    }
  }
  
  return 0;
}