#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<complex>
#include<map>

#define f first
#define s second

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define ALL(c) (c).begin(), (c).end()
#define EPS (1e-10)
using namespace std;

typedef unsigned int uint;
typedef long long ll;
typedef complex<double> P;

const char *name[11] = {
  "light fly",
  "fly",
  "bantam",
  "feather",
  "light",
  "light welter",
  "welter",
  "light middle",
  "middle",
  "light heavy",
  "heavy"
};

const double weight[11] = {
  48.0,
  51.0,
  54.0,
  57.0,
  60.0,
  64.0,
  69.0,
  75.0,
  81.0,
  91.0,
  1e10
};

int main(){
  double w;
  while(cin>>w){
    int i=0;
    while(w > weight[i]) i++;
    cout << name[i] << endl;
  }
  return 0;
}