
    Given a delivery vehicle's identification number (VID), find the next available symmetric routing code that reads the same forwards and backwards, which will be used to pair vehicles for balanced zone distribution. The symmetric routing code must be larger than the current VID and should be returned as an integer value.
    

    
import sys

def next_smallest_palindrome(num):
    """
    Given a delivery vehicle's identification number (VID), find the next available symmetric routing code that reads the same forwards and backwards, which will be used to pair vehicles for balanced zone distribution. The symmetric routing code must be larger than the current VID and should be returned as an integer value.
    

    """
import sys

def next_smallest_palindrome(num):
    """
    Given a delivery vehicle's identification number (VID), find the next available symmetric routing code that reads the same forwards and backwards, which will be used to pair vehicles for balanced zone distribution. The symmetric routing code must be larger than the current VID and should be returned as an integer value.
    

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