#include <bits/stdc++.h>
using namespace std;
const long long linf = LLONG_MAX;
const int MOD = 1000000007;
const int maxn = 1e5 + 10;
const int MAX = 2e4 + 10;
int _size[maxn], vis[maxn];
vector<int> sub;
vector<pair<int, int> > adj[maxn];
int n, k, a, b;
bool first(string second) {
  string a = to_string(linf);
  for (int i = 0; second[i]; i++) {
    if (second[i] > a[i])
      return 0;
    else if (second[i] == a[i]) {
      int j = i;
      while (second[j] == a[j]) ++j;
      if (second[j] > a[j]) return 0;
      return 1;
    }
    return 1;
  }
  return 1;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  string str;
  cin >> str;
  if (str.size() == 19) {
    if (first(str)) {
      cout << "long\n";
      return 0;
    } else {
      cout << "BigInteger\n";
      return 0;
    }
  } else {
    if (str.size() < 19) {
      stringstream sin(str);
      long long t = 0;
      int h = 32767;
      sin >> t;
      if (t <= INT_MAX && t > h) {
        cout << "int\n";
        return 0;
      } else if (t > INT_MAX) {
        cout << "long\n";
        return 0;
      } else if (t <= h) {
        int b = 127;
        if (t <= b) {
          cout << "byte\n";
          return 0;
        } else {
          cout << "short\n";
          return 0;
        }
      }
    } else {
      cout << "BigInteger\n";
      return 0;
    }
  }
}
