[파이썬] 25501 재귀의 귀재

n = int(input())
count = 0

def recursion(s, l, r):
    global count
    count += 1
    if l >= r: return 1
    elif s[l] != s[r]: return 0
    else: return recursion(s, l + 1, r - 1)

def isPalindrome(s):
    return recursion(s, 0, len(s) - 1)

for _ in range(n):
    count = 0
    print(isPalindrome(input()), count)