Определите количество троек последовательности, в которых хотя бы один элемент является пятизначным числом

a = [x.replace('\n', '') for x in open('1.txt')]
 
 
def f(x):
    if len(x) == 5 and x[-2:] == '43':
        return True
 
 
maxx = -100_001
 
for j in range(len(a)):
    if f(a[j]):
        if maxx < int(a[j]):
            maxx = int(a[j])
count = 0
summ = 10**10
for i in range(len(a) - 2):
    if f(a[i]) or f(a[i + 1]) or f(a[i + 2]):
        if int(a[i]) ** 2 + int(a[i + 1]) ** 2 + int(a[i + 2]) ** 2 <= maxx ** 2:
            count += 1
            if summ > int(a[i]) ** 2 + int(a[i + 1]) ** 2 + int(a[i + 2]) ** 2:
                summ = int(a[i]) ** 2 + int(a[i + 1]) ** 2 + int(a[i + 2]) ** 2
print(count, summ)

def is_magic_number(n: int):
    return 9999 < abs(n) < 100000 and abs(n) % 100 == 43
 
 
with open("17-426.txt") as file:
    data = [int(line) for line in file]
 
max_square = max(filter(is_magic_number, data)) ** 2
 
result = [
    triplet
    for triplet in zip(data[:-2], data[1:-1], data[2:])
    if any(map(is_magic_number, triplet))
    and sum(map(lambda x: x * x, triplet)) <= max_square
]
 
print(len(result))
print(min(sum(map(lambda x: x * x, triplet)) for triplet in result))

def f(x):
    return   x[-2:] == '43' and len(x) == 5
         
fileName ="test.txt"
with open(fileName) as f_in:
    a = f_in.read().splitlines()
print(sum(f(x) for x in a))

'-123'.replace('-','')