Go: package main

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

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	for scanner.Scan() {
		a, _ := strconv.ParseFloat(scanner.Text(), 64)
			t := a/9.8
			x := t*t*4.9
			fmt.Printf("%d\n", int(x))
	}
}

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


int main(){
	float v, t, h;
	int n, a;
	while (true){
		cin >> v;
		if (cin.eof()) { break; }
		t = v / 9.8;
		h = 4.8 * t * t;
		for (n = 0;;n++){
			a = 5 * n - 5;
			if (a >= h) { break; }
		}
		cout << n << endl;
	}
	return 0;
}

C++: #include<cstdio>

using namespace std;
int main(void)
{
	double t,v,y,i;
	while(scanf("%lf",&v) != EOF)
	{
		t = v / 9.8;
		y = 4.9 * t *t;

		for(i = 0;;i++)
		{
			if(5*i-5 >= y) break;
		}
		printf("%.0lf\n",i);
	}
	return 0;
}

C++: #include<string>
#include<cmath>
#include<iostream>

using namespace std;
 
int main(){
	double v;

	while(cin >> v){
		int n=1;
		double t,y;

		t=v/9.8;
		y=4.9*t*t;

		while(5*(n-1)<y) n++;

		cout<<n<<endl;
	}
    return 0;
}

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

using namespace std;

int main() {
	double v;
	while (cin >> v){
		double t = v/9.8;
		double y = 4.9*pow(t,2);
		int N;
		for (N=1;;N++) {
			if (5*N-5>=y) break;
		}
		cout << N << endl;
	}
}

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

using namespace std;

#define FOR(i, j, k) for(int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for(int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7

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

int num[5000];

int main() {
	double v;
	while(scanf("%lf", &v) != EOF) {
		double t = v / 9.8;
		double y = 4.9 * t * t;
		double N = (y + 5.0) / 5.0;
		double tmp = N * 1000000.0;
		int a = (int)tmp;
		//cout << a << endl;
		if(a % 10 == 0) printf("%d\n", a / 1000000);
		else printf("%d\n", a / 1000000 + 1);
	}
	return 0;
}

C++: #include<iostream>
#include<map>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
int main(){
	double a,b,c;
	int d,e;
	while(scanf("%lf",&c)!=EOF){
		a=c/9.8;
		b=(a*a*4.9+5)/5;
		d=(a*a*4.9+5)/5;
		if(b!=d)d++;
		printf("%d\n",d);
	}
}

C++: #include<iostream>
#include<string>
#include <stdio.h>
#include <math.h>
#include <cctype>
using namespace std;
int main(){
	double n;
	while(cin>>n){
		double t=n/9.8;
		double y=t*t*4.9;
		int ans=ceil((y+5)/5);
		cout<<ans<<endl;
	}
	return 0;

}

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

using namespace std;

int main()
{
	double v, y;
	
	while (cin >> v){
		y = (v * v) / 19.6;
		double n = (y + 5) / 5;
		cout << (int)ceil(n) << endl;
	}
	return (0);
}

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

#include<vector>

#define INF 999999
using namespace std;
int main(){
    double high,Y,i;
    while(~scanf("%lf",&high)){
        int F=1;
        i=high/9.8;
        Y=4.9*(i*i);
        for(;;){
            if(Y<=0)break;
            Y-=5;
            F++;
        }
        cout<<F<<endl;
    }
    return 0;
}

C++: #include<bits/stdc++.h>
#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 PB push_back
#define MP make_pair
#define FR first
#define SC second
#define int long long
using namespace std;
const int MOD=1000000007;
const int INF=9000000009;

signed main(){
  double v;
  while(cin>>v){
    double t=v/9.8;
    double y=4.9*pow(t,2);
    for(int i=1;;i++){
      int N=5*i-5;
      if(N>y){
        cout<<i<<endl;
        break;
      }
    }
  }
  return 0;
}

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

typedef double dbl;

int main() {
	dbl v, t, y;
	while (cin >> v) {
		t = v / 9.8;
		y = 4.9 * t * t;
		int N = 1;
		while (5 * N - 5 < y) {
			N++;
			if (5 * N - 5 >= y) {
				cout << N << endl;
				break;
			}
		}
	}
}

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

int main(){
    double v;
    while(cin>>v){
        double y = v*v/19.6;

        int i=1;
        for(;;){
            if(y<5*i-5) break;
            i++;
        }
        cout << i << endl;
    }


return 0;
}

C++: #include <iostream>

using namespace std;

int main () {

    double t,v,y;
    while(cin >> v){
        t = v/9.8;
        y = 4.9 * t * t;
        int N = 0;
        while(5*N-5<y) N++;
        cout << N << endl;
    }

    return 0;
}

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

int main(){
	
	double v;
	double t,y;
	double N;
	while(cin>>v){
		t=v/9.8;
		y=4.9*pow(t,2.0);
		N = (y+5)/5;
		printf("%.0f\n",N);
	
	}
		
	
}

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

int main(){
	double v,t,y;
	while(cin>>v){
		t = v/9.8;
		y = 4.9*t*t;
		cout<<ceil(y/5)+1<<endl;
	}
	return 0;
}

C++: #include<iostream>
#include<cmath>
using namespace std;
int main(){
  double v;
  while(cin >>v){
    double h = v*v/(9.8*2);
    cout <<ceil((h+5)/5)<<endl;
  }
  return 0;
}

C++: #include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <cctype>
#include <iostream>
#include <set>
#include <string>
#include <queue>
#include <map>
using namespace std;
int size(string x){
	string::size_type size=x.size();
	return size;
}
#define fu(l,k) for(int i=l;i<k;i++)
#define fd(l,k) for(int i=l;i>k;i--)
#define fi first
#define se second
typedef  vector<string> vs;
typedef  vector<int> vi;
double pi(){
	return M_PI;
}
typedef set<int> set_i;
typedef set<string> set_s;
int main(){
	double n,x,t,h;
	while(cin>>x){
		t=x/9.8;
		h=4.9*x*x/(9.8*9.8);
		n=h/5;
		if(h%5!=0) cout<<(int)n+2<<endl;
		else cout<<(int)n+1<<endl;
	}
}

C++: #include<iostream>
using namespace std;
int main()
{
long double v,n;
int N;
while(cin>>v)
{
n=(4.9*((v/9.8)*(v/9.8)))/5+1;
N=n*10000;	
if(N%10000==0)
{
	cout<<N/10000<<endl;
}
else if(N%10000!=0)
{
	cout<<N/10000+1<<endl;
}
}
return 0;
}

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

int main() {
	float v,t;
	double y;
	
	while ( cin >> v ) {
		t = v / 9.8;
		y = 4.9 * t * t;
		y = (y + 5.0)/5.0;
		
		y = ceil( y );
		
		cout << y << endl;
	}
	return 0;
}

C++: #include <iostream>
using namespace std;
int main()
{
    double v;
    while(cin >> v,v)
    {
        double t = 0,y = 0;
        t = v/9.8;
        y = 4.9*t*t;

        double f = 0;
        y = y-5;
        f = y/5;
        cout << f+1 << endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using ld = long double;
const ld eps = 1e-12;

int main()
{
	ld v;
	while (cin >> v) {
		for (int i = 1;; i++) {
			if (v * v / 19.6 - eps <= 5 * i - 5) {
				cout << i << endl;
				break;
			}
		}
	}
	return 0;
}

C++: //#define _USE_MATH_DEFINES
#include <cmath>
#include <iostream>
//#include <stdio.h>
//#include <stdlib.h>
//#include <iomanip>
#include <vector>
//#include <string>
//#include <algorithm>
//#include <functional>
//#include <time.h>
//#include <sstream>
//#include <queue>

using namespace std;


int main(){

	const int H = 5;
	double v, t, y;
	int ans;

	while (cin >> v){
		if (v <= 0) ans = 1;
		else{
			t = v / 9.8;
			y = 4.9 * t * t;
			ans = (int)((y + 10 + 1) / H);
		}
		cout << ans << endl;
	}


	return 0;
}

C++: #include <stdio.h>

#define G 9.8
int main(void){
    double v,h;
    int fl;
    
    while (scanf("%lf", &v)!=EOF){
        h=v*v/(2*G);
        for (fl=1; (5*fl-5)<h; fl++) ;
        printf("%d\n", fl);
    }

    return 0;
}

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

using namespace std;

int main()
{
	double min_v;
	
	while (cin >> min_v) {
		double crack_height = (min_v * min_v) / 19.6;
		int N = ceil( (crack_height)/5.0 ) + 1;
		cout << N << endl;
	}
		
	return 0;
}

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

double dp[1000] = { 0 };

int height(double v) {
	for (int i = 2; i < 1000; i++) {
		if (dp[i] == 0) {
			double t = std::sqrt((5 * i - 5) / 4.9);
			dp[i] = 9.8 * t;
		}
		if (dp[i] >= v) return i;
	}
	return 0;
}

int main() {
	double v;
	while (std::cin >> v) {
		std::cout << height(v) << std::endl;
	}
	return 0;
}