#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 INF=1000000;
int main(){
	double n;
	while(cin>>n){
		if(n<=48.00) cout<<"light fly"<<endl;
		else if(n<=51.00) cout<<"fly"<<endl;
		else if(n<=54.00) cout<<"bantam"<<endl;
		else if(n<=57.00) cout<<"feather"<<endl;
		else if(n<=60.00) cout<<"light"<<endl;
		else if(n<=64.00) cout<<"light welter"<<endl;
		else if(n<=69.00) cout<<"welter"<<endl;
		else if(n<=75.00) cout<<"light middle"<<endl;
		else if(n<=81.00) cout<<"middle"<<endl;
		else if(n<=91.00) cout<<"light heavy"<<endl;
		else cout<<"heavy"<<endl;
	}
}