Числа палиндромы

    num_str = input()
    tmp_num = 0
    while not num_str == num_str[::-1]:
        tmp_num = int(num_str) + 1
        num_str = str(tmp_num)
    print(num_str)

def get_palindrome_no_less_than(n):
    sn = str(n)
    if len(sn) % 2 == 0:
        half_sn = sn[ : len(sn)//2 : ]
        sn_new = half_sn + half_sn[::-1]
        while sn_new < sn:
            n_half = int(half_sn)
            n_half += 1
            half_sn = str(n_half)
            sn_new = half_sn + half_sn[::-1]
            if len(sn_new) > len(sn):
                sn_new = half_sn[:-1] + half_ns[::-1]       
    else:
        half_sn = sn[ : len(sn)//2 + 1 : ]
        sn_new = half_sn[:-1] + half_sn[::-1]
        while sn_new < sn:
            n_half = int(half_sn)
            n_half += 1
            half_sn = str(n_half)
            sn_new = half_sn[:-1] + half_sn[::-1]
            if len(sn_new) > len(sn):
                half_sn = half_sn[:-1]
                sn_new = half_sn + half_sn[::-1]  
    return int(sn_new)
#===============================================================================
def main():
    n = int(input('n = '))
    res = get_palindrome_no_less_than(n + 1)
    print(res)
main()

def is_palindrome(x: int) -> bool:
    temp = x
    val = 0
    while temp > 0:
        val = val * 10 + temp % 10
        temp //= 10
    return val == x

num = input()
 
k = len(num)
n = num[:k//2 + k%2]
res = int(n + n[:k//2][::-1])
 
while res <= int(num):
    n = str(int(n) + 1)
    res = int(n + n[:k//2][::-1])
print(res)