1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;

public class ilo
{
    public static void main( String[] args )
    {
        new ilo().start();
        
        System.exit( 0 );
    }
    
    
    public void start()
    {
        int numOfQueries = readIntFromStdIn();
        
        outer:
        for( int i=0; i<numOfQueries; i++)
        {
            List<Integer> fibonaccis = new ArrayList<Integer>();
            fibonaccis.add( 0 );
            fibonaccis.add( 1 );
            
            int testNum = readIntFromStdIn();
            
            if( testNum == 0 )
            {
                answerYes();
                continue outer;
            }
            
            int k = 2;
            while( fibonaccis.get( k - 1 ) + fibonaccis.get( k - 2 ) <= testNum )
            {
                if( fibonaccis.get( k - 1 ) * fibonaccis.get( k - 2 ) == testNum ||
                    fibonaccis.get( k - 1 ) * fibonaccis.get( k - 1 ) == testNum )
                {
                    answerYes();
                    continue outer;
                }
                
                fibonaccis.add( fibonaccis.get( k - 1 ) + fibonaccis.get( k - 2 ) );
                
                if( fibonaccis.contains( testNum ) )
                {
                    answerYes();
                    continue outer;
                }
                
                k++;
            }
            
            while( k-- >= 0 )
            {
                for( int reverseK = k-2; reverseK >=0; reverseK-- )
                {
                    if( fibonaccis.get( k ) * fibonaccis.get( reverseK ) == testNum )
                    {
                        answerYes();
                        continue outer;
                    }
                }
            }
            
            answerNo();
        }
    }


    private void answerYes()
    {
        System.out.println( "TAK" );
    }


    private void answerNo()
    {
        System.out.println( "NIE" );
    }


    private int readIntFromStdIn()
    {
        InputStreamReader in = new InputStreamReader(System.in);
        BufferedReader keyboard = new BufferedReader(in);
        
        try
        {
            return Integer.parseInt( keyboard.readLine() );
        }
        catch( Exception e )
        {
            e.printStackTrace();
        }
        
        return 0;
    }
}