
def 		lowercase_    (     A__	)							->							bool:
    """simple docstring"""

    return str(_SCREAMING_SNAKE_CASE	) == str(_SCREAMING_SNAKE_CASE	)[::-1]



def 		lowercase_    (     A__	)							->							int:
    """simple docstring"""

    return int(_SCREAMING_SNAKE_CASE	) + int(str(_SCREAMING_SNAKE_CASE	)[::-1]	)



def 		lowercase_    (     A__ = 1_0000	)							->							int:
    """simple docstring"""

    snake_case				  =      []
    for num in range(1				,	_SCREAMING_SNAKE_CASE	):
        snake_case				  =      0
        snake_case				  =      num
        while iterations < 50:
            snake_case				  =      sum_reverse(_SCREAMING_SNAKE_CASE	)
            iterations += 1
            if is_palindrome(_SCREAMING_SNAKE_CASE	):
                break
        else:
            lychrel_nums.append(_SCREAMING_SNAKE_CASE	)
    return len(_SCREAMING_SNAKE_CASE	)


if __name__ == "__main__":
   print(f"{solution() = }")








import os

# Precomputes a list of the 100 first triangular numbers
_A						      =				[int(0.5 * n * (n + 1)) for n in range(1, 1_01)]



def 		lowercase_    (     )							->							Tuple:
    """simple docstring"""

    snake_case				  =      os.path.dirname(os.path.realpath(A__	)	)
    snake_case				  =      os.path.join(A__				,	"words.txt"	)

    snake_case				  =      ""
    with open(A__	) as f:
        snake_case				  =      f.readline()

    snake_case				  =      [word.strip("\""	) for word in words.strip("\r\n"	).split(","	)]
    snake_case				  =      [
        word
        for word in [sum(ord(A__	) - 64 for x in word	) for word in words]
        if word in TRIANGULAR_NUMBERS
    ]
    return len(A__	)


if __name__ == "__main__":
   print(solution())

