#include <stdio.h>
 
// Function to check if Tajbin can win based on the parity of max distances
int checkTajbinWin(long maxDistances[], int n) {
    // Count the number of dimensions with odd maximum distances
    int oddCount = 0;
    for (int i = 0; i < n; i++) {
        if (maxDistances[i] % 2 != 0) {
            oddCount++;
        }
    }
    // If there are odd number of dimensions with odd maximum distances, Tajbin wins
    return oddCount % 2 != 0;
}
 
int main() {
    int n;
    scanf("%d", &n);
    long maxDistances[n];
    for (int i = 0; i < n; i++) {
        scanf("%ld", &maxDistances[i]);
    }
 
    // Check if Tajbin can win based on the parity of max distances
    int tajbinWins = checkTajbinWin(maxDistances, n);
 
    // Output the winner
    if (tajbinWins) {
        printf("Tajbin\n");
    } else {
        printf("Tanvir\n");
    }
 
    return 0;
}