import java.io.*;
import java.util.*;
import java.math.*;

public class Solution {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();
        for (int i=0; i<q; i++){
            BigInteger bigInt = sc.nextBigInteger();
            int check_l = bigInt.compareTo(BigInteger.valueOf(Long.MAX_VALUE));
            int check_s = bigInt.compareTo(BigInteger.valueOf(Long.MIN_VALUE));
            if (check_l ==1 || check_s == -1){
                System.out.println(bigInt + " can't be fitted anywhere.");
            }
            else{
                long num = bigInt.longValue();
                System.out.println(bigInt + " can be fitted in:");
                if (num <= Byte.MAX_VALUE && num >= Byte.MIN_VALUE){
                    System.out.println("* byte");
                }
                if(num <= Short.MAX_VALUE && num >= Short.MIN_VALUE){
                    System.out.println("* short");
                }
                if(num <= Integer.MAX_VALUE && num >= Integer.MIN_VALUE){
                    System.out.println("* int");
                }
                if (num <= Long.MAX_VALUE && num >= Long.MIN_VALUE){
                    System.out.println("* long");
                }
            }
        }
    }
}