#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;

double g, kg[] = { 48, 51, 54, 57, 60, 64, 69, 75, 81, 91 };
string c[] = { "light fly", "fly", "bantam", "feather", "light",
"light welter", "welter", "light middle", "middle", "light heavy",
"heavy" };

int main(){
	while (cin >> g){
		bool f = 0;
		for (int i = 0; i < 10; i++){
			if (g <= kg[i]){
				cout << c[i] << endl;
				break;
			}
			if (i == 9)f = 1;
		}
		if (f)cout << c[10] << endl;
	}
}