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++: //#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;

// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x; i<=(int)n; ++i)
#define ILP while(true)
#define FOR(i,c) for(__typeof((c).begin())!=(c).begin(); i!=(c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp make_pair
#pragma endregion

// ???
#pragma region TYPE_DEF
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long> vl;
typedef vector<long long> vll;
typedef vector<string> vs;
#pragma endregion

// Effective std
#pragma region ESTD
template<typename C, typename T> int count(C& c, T t) { return count(ALL(c), t); }
template<typename C, typename F> int count_if(C& c, F f) { return count_if(ALL(c), f); }
template<typename C, typename T> void erase(C& c, T t) { remove(ALL(c), t), c.end(); }
template<typename C> void remove(vector<C>& c, unsigned int index) { c.erase(c.begin()+index); }
template<typename C, typename T, typename U> void replace(C& c, T t, U u) { replace(ALL(c), t, u); }
template<typename C, typename F, typename U> void replace_if(C& c, F f, U u) { (ALL(c), f, u); }
template<typename C> void reverse(C& c) { reverse(ALL(c)); }
template<typename C> void sort(C& c) { sort(ALL(c)); }
template<typename C, typename Pred> void sort(C& c, Pred p) { sort(ALL(c), p); }
#pragma endregion

// ?????°
#pragma region CONST_VAL
#define PI (2*acos(0.0))
#define EPS (1e-9)
#define MOD (int)(1e9+7)
#define INF numeric_limits<int>::infinity()
#pragma endregion


int main()
{
    vi v;
    int s;
    float w, h;
    while(scanf("%d,%f,%f",&s,&w,&h)!=EOF) {
        if (w/(h*h)>=25) v.push_back(s);
    }
    for (int el : v) P(el);
    return 0;
}

C++: #include<iostream>
#include<sstream>
using namespace std;
int main(){
  string s;
  while(cin >> s) {
    for(int i=0;i<s.size();i++) if(s[i]==',') s[i]=' ';
    stringstream ss(s);
    int id;double w,h;
    ss >> id >> w >> h;
    double bmi=w/(h*h);
    if(bmi>=25.0) cout << id << endl;
  }
}

C++: #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,b) FOR(i,0,b)
#define BE(c) c.begin(),c.end()
#define PB push_back
#define F first
#define S second
#define BEB(s) s
using namespace std;
int main(){
	char com;
	double BMI,b,c;
	int a;
	while(cin>>a>>com>>b>>com>>c){
		if(25<=b/(c*c))cout<<a<<endl;
	}
	return 0;
}

C++: // BMI

#include <iostream>
#include <map>
#include <cstdio>

using namespace std;

int main(void)
{
	map<int, double> students; // 学籍番号とBMI
	int num;
	double weight, height;
	double BMI;

	while (scanf("%d,%lf,%lf", &num, &weight, &height) == 3) {
		BMI = weight / (height * height);

		students.insert(make_pair(num, BMI));
	}

	for (map<int, double>::const_iterator it = students.begin();
		it != students.end(); it++) {
		if ((*it).second >= 25.0) {
			cout << (*it).first << endl;
		}
	}

	return 0;
}

C++: #include<stdio.h>

int main(){

double y,z;
int x;
while(scanf("%d,%lf,%lf",&x.&y,&z);
if((y/z/z)>=25)printf("%d\n",x);
}
return 0;
}

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

const double EPS = 1e-9;

//æØè¶ÅæØéB
//s=üÍ,t=æØè¶
std::vector<string> splitAll(string s,string t){

  std::vector<string> v;

  for(int p=0; (p = s.find(t)) != s.npos; ){
    v.push_back(s.substr(0,p));
    s=s.substr(p+t.size());
  }
  v.push_back(s);

  return v;
}


int main() {

  string s;
  while(getline(cin,s)){
    if( s=="" ) break;
    vector<string> v;
    v = splitAll(s,",");
    double w = atof( v[1].c_str() );
    double h = atof( v[2].c_str() );
    if( (w/(h*h) - 25.0) > -EPS ) {
      cout<<v[0]<<endl;
    }
  }
}

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

int main(){
	int num,f;
	double kg,m,bmi;
	while(scanf("%d,%lf,%lf",&num,&kg,&m)!=EOF){
		bmi=0;
		bmi=kg/(m*m);
		if(bmi>=25.0)cout<<num<<endl;
	}
}

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

int main()
{
	int n;
	char p,q;
	double w,h;
	while(cin >> n >> p >> w >> q >> h)
	{
		if(w/h/h>=25)
		{
			cout << n << endl;
		}
	}
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main(){
	int s;
	double w,h;
	while(cin>>s>>w>>h){
		if(w/h/h>=25)cout<<w<<endl;
		}
    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]);
	}
}

C++: #include <stdio.h>

int main(){
int num;
double wei,high;

while(scanf("%d,%f,%f",&num,&wei,&high) != EOF){
if(wei / (high * high) >= 25.0) printf("%d\n",num);
}

return 0;
}

C++: #include <stdio.h>

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

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

using namespace std;

#define int long long
#define all(v) (v).begin(), (v).end()
#define reps(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) reps(i, 0, n)

template<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}
template<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}

typedef pair<int, int> Pi;
typedef tuple<int, int, int> Ti;
typedef vector<int> vint;

const int inf = 1LL << 55;
const int mod = 1e9 + 7;

signed main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  int s;
  double w, h;
  while(scanf("%lld,%lf,%lf", &s, &w, &h) != EOF) {
    double bmi = w/h/h;
    if(bmi >= 25 + 1e-9) printf("%lld\n", s);
  }

  return 0;
}

C++: #include<iostream>
#include<string.h>
#include<vector>
#include<list>
#include<stdio.h>
#include<math.h>
#include<iomanip>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug " << x << endl;
using namespace std;

int main(){
    string s;
    while(cin >> s){
        int num = stoi(s.substr(0, s.find(',')));
        double m = stof(s.substr(s.find(',')+1, s.rfind(',')-1-s.find(',')));
        double h = stof(s.substr(s.rfind(',')+1, s.size()+1-s.rfind(',')));
        double BMI = m / (h * h);
        if(BMI >= 25){
            cout << num << endl;
        }
    }
}

C++: #include<iostream>

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

C++: #include<iostream>
#include<cstdio>

using namespace std;

int main(void)
{
	int num;
	double weight, height, bmi;
	
	while( cin >> num >> weight >> height ){
		bmi = weight / (height * height);
		
		if(bmi >= 25)
		cout << num << endl;
	}
	return 0;
}

C++: #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
    int num;
    double weight,height;
    while(scanf("%d,%lf,%lf",&num,&weight,&height)!=EOF)if(25<=weight/height/height)cout<<num<<endl;
    return 0;
}