//The first line contains an integer, T, denoting the number of test cases.
//Each test case, T, is comprised of a single line with an integer, n, which can be arbitrarily large or small.
//Output Format
//For each input variable n and appropriate primitive dataType, you must determine if the given primitives are capable of storing it. If yes, then print:
//n can be fitted in:
//* dataType
//If there is more than one appropriate data type, print each one on its own line and order them by size (i.e.: byte<short<int<long).
//If the number cannot be stored in one of the four aforementioned primitives, print the line:
//n can't be fitted anywhere.
//Sample Input
//5
//-150
//150000
//1500000000
//213333333333333333333333333333333333
//-100000000000000
//Sample Output
//-150 can be fitted in:
//* short
//* int
//* long
//150000 can be fitted in:
//* int
//* long
//1500000000 can be fitted in:
//* int
//* long
//213333333333333333333333333333333333 can't be fitted anywhere.
//-100000000000000 can be fitted in:
//* long
//Explanation
// -150 can be stored in a short, an int, or a long.
//213333333333333333333333333333333333 is very large and is outside of the allowable range of values for the primitive data types discussed in this problem.
//Solution
importjava.util.Scanner;
publicclassPrimitiveDataTypes {
publicstaticvoidmain(String[] args) {
try (Scannersc = newScanner(System.in)) {
intt = sc.nextInt();
for (inti = 0; i < t; i++) {
try {
longx = sc.nextLong();
System.out.println(x + " can be fitted in:");
if (x >= -128 && x <= 127) {
System.out.println("* byte");
}
if (x >= -32768 && x <= 32767) {
System.out.println("* short");
}
if (x >= -2147483648 && x <= 2147483647) {
System.out.println("* int");
}
if (x >= -9223372036854775808L && x <= 9223372036854775807L) {
System.out.println("* long");
}
} catch (Exceptione) {
System.out.println(sc.next() + " can't be fitted anywhere.");