Codeforces Beta Round 61 (Div. 2)
A
Petya and Java
Codeforces
1300
原题
←B →
翻译中…

Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best choice. The main argument in favor of choosing Java was that it has a very large integer data type, called BigInteger.

翻译中…

But having attended several classes of the club, Petya realized that not all tasks require using the BigInteger type. It turned out that in some tasks it is much easier to use small data types. That's why a question arises: "Which integer type to use if one wants to store a positive integer $*n*$?"

翻译中…

Petya knows only 5 integer types:

翻译中…
  1. byte occupies 1 byte and allows you to store numbers from $- 128$ to $127$
翻译中…
  1. short occupies 2 bytes and allows you to store numbers from $- 32768$ to $32767$
翻译中…
  1. int occupies 4 bytes and allows you to store numbers from $- 2147483648$ to $2147483647$
翻译中…
  1. long occupies 8 bytes and allows you to store numbers from $- 9223372036854775808$ to $9223372036854775807$
翻译中…
  1. BigInteger can store any integer number, but at that it is not a primitive type, and operations with it are much slower.
翻译中…

For all the types given above the boundary values are included in the value range.

翻译中…

From this list, Petya wants to choose the smallest type that can store a positive integer $*n*$. Since BigInteger works much slower, Peter regards it last. Help him.

翻译中…

Input

翻译中…

The first line contains a positive number $*n*$. It consists of no more than $100$ digits and doesn't contain any leading zeros. The number $*n*$ can't be represented as an empty string.

翻译中…

Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cout (also you may use %I64d).

翻译中…

Output

翻译中…

Print the first type from the list "byte, short, int, long, BigInteger", that can store the natural number $*n*$, in accordance with the data given above.

翻译中…

样例

Input #1
127
Output #1
byte
InputCopy OutputCopy
Input #2
130
Output #2
short
InputCopy OutputCopy
Input #3
123456789101112131415161718192021222324
Output #3
BigInteger
InputCopy OutputCopy
题目信息
题号
66A
时间限制
2 s
内存限制
256 MB
标签
模拟
字符串

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。