#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
#include <complex>
#include <map>
using namespace std;

#define rep(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8

static const double PI=6*asin(0.5);
typedef complex<double> P;
typedef long long ll;

double w;

int main(){
	while(cin>>w){
		if(w<=48.0) cout<<"light fly\n";
		else if(w<=51.0) cout<<"fly\n";
		else if(w<=54.0) cout<<"bantam\n";
		else if(w<=57.0) cout<<"feather\n";
		else if(w<=60.0) cout<<"light\n";
		else if(w<=64.0) cout<<"light welter\n";
		else if(w<=69.0) cout<<"welter\n";
		else if(w<=75.0) cout<<"light middle\n";
		else if(w<=81.0) cout<<"middle\n";
		else if(w<=91.0) cout<<"light heavy\n";
		else cout<<"heavy\n";
	}
	return 0;
}