
    Given a delivery route identifier number, find the next larger number that reads the same forwards and backwards to establish a symmetric two-way route tracking system. The new route identifier must be the smallest possible palindrome greater than the current number to maintain efficient route numbering sequences.
    

    
import sys

def next_smallest_palindrome(num):
    """
    Given a delivery route identifier number, find the next larger number that reads the same forwards and backwards to establish a symmetric two-way route tracking system. The new route identifier must be the smallest possible palindrome greater than the current number to maintain efficient route numbering sequences.
    

    """
import sys

def next_smallest_palindrome(num):
    """
    Given a delivery route identifier number, find the next larger number that reads the same forwards and backwards to establish a symmetric two-way route tracking system. The new route identifier must be the smallest possible palindrome greater than the current number to maintain efficient route numbering sequences.
    

    """
    numstr = str(num)
    for i in range(num + 1, sys.maxsize):
        if str(i) == str(i)[::-1]:
            return i