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
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <complex>
#include <math.h>

using namespace std;

//conversion
//------------------------------------------
inline long toLong(string s) {long v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

const long double EPS = 1e-18;
const double INF = 1e9;



int main(){
	long num;
	long double w,h;
	char c1,c2;
	vector<long>res;
	while(cin>>num>>c1>>w>>c2>>h){
		if(w>=(25.0)*(h*h)+EPS)res.PB(num);
	}
	REP(i,SZ(res))cout<<res[i]<<endl;
	return 0;
}

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) > 24.999999){BMI.push_back(num);}
	}
	for(int i=0; i<BMI.size(); i++){
		cout <<BMI[i]<<endl;
	}
}

C++: #include <iostream>
using namespace std;
int main(){
    int n;
    double a,b;
    char c;
    while (cin >> n >> c >> a >> c >> b){
        double bmi = a/b/b;
        if(bmi>=25)
            cout << n << endl;
    }
}

C++: #include <bits/stdc++.h>
#define r(i,a,n) for(int i=a;i<n;i++)
using namespace std;
int main(){
	int a;
	double b,c;
	while(scanf("%d,%lf,%lf",&a,&b,&c)!=EOF){
		if(25<=(b/(c*c)))cout<<a<<endl;
	}
}

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

int main(){

	int num,c=0;
	double w,h;

	while(~scanf("%d,%lf,%lf\n", &num, &w, &h)){
		if(25<=w/(h*h)){
			cout << num << endl;
			c++;
		}
	}

	if(c==0){
		cout << "ツ該ツ督鳴づ按つオ" << endl;
	}

	return 0;
}

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>
#include <cstdio>
#include <cmath>
using namespace std;
#define rep2(x,from,to) for(int x = (from); x < (to); ++(x))
#define rep(x,to) rep2(x,0,to)
int main() {
	int n;
	double w, h;
	char a, b;
	while(cin >> n >> a >> w >> b >> h) {
		if(w/pow(h,2.0) >= 25) cout << n << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define rp(a) while(a--)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-10;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(){
	int a;
	double b,c;
	char x;
	while(cin>>a>>x>>b>>x>>c){
		if(b/c/c+EPS>25.0)cout<<a<<endl;
	}
}

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

main(){
  int id;
  double w, h, bmi;
  char ch;
  while( cin >> id >> ch >> w >> ch >> h ){
    bmi = w/(h*h);
    if ( bmi >= 25.0 ) cout << id << endl;
  }

}

C++: #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;

int main()
{
    for(;;){
        int id;
        double w, h;
        char c;
        if(!(cin >> id >> c >> w >> c >> h))
            return 0;

        if(w / (h*h) >= 25.0)
            cout << id << endl;
    }
}

C++: 
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
using namespace std;

int main() {
	int s;
	double w, h;
	char a;
	while (cin >> s >> a >> w >> a >> h) {
		if (w / h / h > 25) {
			cout << s << endl;
		}
	}
}

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

int main(){

	int n;
	cin>>n;
	vector<int> s(n);
	vector<double> h(n);
	vector<double> w(n);
	char cnm[2];
	
	for(int i=0;i<n;i++){
		double BMI;
		cin>>s[i]>>cnm[0]>>w[i]>>cnm[1]>>h[i];
		
		BMI = w[i]/pow(h[i],2);
		
		if(BMI>=25.0){
			cout<<s[i]<<endl;
		}
	}

}

C++: #include<bits//stdc++.h>
using namespace std;
int main(){
	int a;
	double b,c;
	while(true){
		scanf("%d,%lf,%lf",&a,&b,&c);
		if(cin.fail())break;
		if(c==0) break;
		if(b/(c*c)>=25) cout<<a<<endl;
	}
}

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

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <map>
#include <numeric>
using namespace std;

#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,n) for(long long int i=0;i<(n);i++)
#define ALL(s) (s).begin(),(s).end()

#define PI 3.14159265358479

typedef long long ll;
typedef vector<long long int> vi;
typedef vector<long long int>::iterator vit;

int main(){
	int n, c = 0;
	double l, m;
	vector<ll> vi;
	for (int i = 0; i < 5; i++){
		scanf("%d,%lf,%lf", &n, &l, &m);
			if (l / powl(m, 2) >= 25){
				vi.push_back(n);
				c++;
			}
	}
	if (c == 0){
		cout << "????????????\n";
	}
	else{
		REP(i, c){
			cout << vi[i] << "\n";
		}
	}
	return 0;
}

C++: #include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;

int main(){
    int mod=1000000007;
    int teep=120*60;
    int s;
    double w,h;
    while(scanf("%d,%lf,%lf",&s,&w,&h)!=EOF) {
        if (25.0-w/(h*h)<1e-10) printf("%d\n",s);
    }
    return 0;
}

C++: #include <cstdio>
#include <cmath>
#include <vector>
using namespace std;
int main() {
	vector<int> over;
	int num;
	double w, h;
	while (scanf("%d, %f, %f",&num,&w,&h)!=EOF) {
		if (w/(h*h)<=25) over.push_back(num);
	}
	if (over.empty()) {
		printf("ツ該ツ督鳴づ按つオ\n");
	} else {
		for (int i=0; i<over.size(); i++) printf("%d\n",over[i]);
	}
}