#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

#define rep(i, n) for(int i = 0; i < n; i ++)
#define ALL(T) T.begin(), T.end()
#define mp make_pair
#define pb push_back

using namespace std;

typedef pair<int, int> pii;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<string> vs;

const int INF = 1 << 24;

const double W[12] = {0., 48., 51., 54., 57., 60., 64., 69., 75., 81., 91., (double)INF};
const string CLASS[11] = {"light fly", "fly", "bantam", "feather", "light", "light welter", "welter", "light middle", "middle", "light heavy", "heavy"};

int main(void){
    for(double w; cin >> w;)
        rep(i, 11) if(W[i] < w && w <= W[i + 1]) cout << CLASS[i] << endl;

    return 0;
}