




'''simple docstring'''







def 						snake_case_							(_a     :							int = 1_0_0_0					):
    UpperCAmelCase      	=		0
    UpperCAmelCase      	=		0
    while 1:
        num += 3
        if num >= n:
            break
        total += num
        num += 2
        if num >= n:
            break
        total += num
        num += 1
        if num >= n:
            break
        total += num
        num += 3
        if num >= n:
            break
        total += num
        num += 1
        if num >= n:
            break
        total += num
        num += 2
        if num >= n:
            break
        total += num
        num += 3
        if num >= n:
            break
        total += num
    return total


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










'''simple docstring'''







def 						snake_case_							(_a     :							int = 9_9_8_0_0_1					):
    UpperCAmelCase      	=		0
    for i in range(9_9_9   ,       9_9   ,       -1					):  # 3 digit numbers range from 999 down to 100
        for j in range(9_9_9   ,       9_9   ,       -1					):
            UpperCAmelCase      	=		str(i * j					)
            if product_string == product_string[::-1] and i * j < n:
                UpperCAmelCase      	=		max(_a   ,       i * j					)
    return answer


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




