import java.util.Scanner;


public class Solution {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int t = scan.nextInt();
        
        while (t-- > 0) {
            try {
                long n = scan.nextLong();
                solve(n);
            } catch(Exception e) {
                System.out.println(scan.next() + " can't be fitted anywhere.");
            }
        }
        
        scan.close();
    }
    
    static void solve(long n) {
        System.out.println(n + " can be fitted in:");
        if (n >= Byte.MIN_VALUE && n <= Byte.MAX_VALUE)
            System.out.println("* byte");
        
        if (n >= Short.MIN_VALUE && n <= Short.MAX_VALUE)
            System.out.println("* short");
            
        if (n >= Integer.MIN_VALUE && n <= Integer.MAX_VALUE)
            System.out.println("* int");
            
        if (n >= Long.MIN_VALUE && n <= Long.MAX_VALUE)
            System.out.println("* long");
    }
}