#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx,avx2,fma")
long long int add(long long int x, long long int y) {
  long long int res = x + y;
  return (res >= 1000000007 ? res - 1000000007 : res);
}
long long int mul(long long int x, long long int y) {
  long long int res = x * y;
  return (res >= 1000000007 ? res % 1000000007 : res);
}
long long int sub(long long int x, long long int y) {
  long long int res = x - y;
  return (res < 0 ? res + 1000000007 : res);
}
long long int power(long long int x, long long int y) {
  long long int res = 1;
  x %= 1000000007;
  while (y) {
    if (y & 1) res = mul(res, x);
    y >>= 1;
    x = mul(x, x);
  }
  return res;
}
long long int mod_inv(long long int x) { return power(x, 1000000007 - 2); }
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  {
    string s;
    cin >> s;
    if (s.length() > 19) {
      cout << "BigInteger";
      return 0;
    }
    long double a = 0;
    int n = s.length();
    for (int i = 0; i < n; i++) {
      a *= 10;
      a += (s[i] - '0');
    }
    if (a < 128) {
      cout << "byte";
      return 0;
    }
    if (a <= 32767) {
      cout << "short";
      return 0;
    }
    if (a <= 2147483647) {
      cout << "int";
      return 0;
    }
    if (a <= 9223372036854775807) {
      cout << "long"
           << "\n";
      return 0;
    }
    cout << "BigInteger"
         << "\n";
  }
  cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs"
       << "\n";
  return 0;
}
