#!/usr/bin/env python3 # from typing import * import sys import io import math import collections import decimal import itertools import bisect import heapq def input(): return sys.stdin.readline()[:-1] # sys.setrecursionlimit(1000000) # _INPUT = """1 2 3 2 # """ # sys.stdin = io.StringIO(_INPUT) N1, N2, N3, N4 = map(int, input().split()) N = N1 + N2 + N3 + N4 Gr = [[[[[-1] * (N+1) for _ in range(N4+1)] for _ in range(N3+1)] for _ in range(N2+1)] for _ in range(N1+1)] for n1 in range(N1+1): for n2 in range(N2+1): for n3 in range(N3+1): for n4 in range(N4+1): for a in range(N+1): if n1 == 0 and n2 == 0 and n3 == 0 and n4 == 0: if a > N//2: Gr[0][0][0][0][a] = 1 else: Gr[0][0][0][0][a] = 0 else: b = N - (n1 + n2 + n3 + n4) - a s = set() for i in [1, 2, 3]: if n1 - i > 0: s.add(Gr[n1-i][n2][n3][n4][b]) elif n1 - i == 0: s.add(Gr[n1-i][n2][n3][n4][b//2]) if n2 - i > 0: s.add(Gr[n1][n2-i][n3][n4][b]) elif n2 - i == 0: s.add(Gr[n1][n2-i][n3][n4][b//2]) if n3 - i > 0: s.add(Gr[n1][n2][n3-i][n4][b]) elif n3 - i == 0: s.add(Gr[n1][n2][n3-i][n4][b//2]) if n4 - i > 0: s.add(Gr[n1][n2][n3][n4-i][b]) elif n4 - i == 0: s.add(Gr[n1][n2][n3][n4-i][b//2]) mex = 0 while mex in s: mex += 1 Gr[n1][n2][n3][n4][a] = mex g = Gr[N1][N2][N3][N4][0] if g == 0: print('Jiro') else: print('Taro')