
    Given a user's current recommendation score, find the next palindromic score value that's larger than the current score to ensure symmetric matching between potential friend pairs in the social network. The palindromic property of the new score guarantees that when two users are matched, their connection ID remains identical regardless of which user initiates the friendship request. The score must be returned as an integer and represent the smallest possible palindrome greater than the input value.
    

    
import sys

def next_smallest_palindrome(num):
    """
    Given a user's current recommendation score, find the next palindromic score value that's larger than the current score to ensure symmetric matching between potential friend pairs in the social network. The palindromic property of the new score guarantees that when two users are matched, their connection ID remains identical regardless of which user initiates the friendship request. The score must be returned as an integer and represent the smallest possible palindrome greater than the input value.
    

    """
import sys

def next_smallest_palindrome(num):
    """
    Given a user's current recommendation score, find the next palindromic score value that's larger than the current score to ensure symmetric matching between potential friend pairs in the social network. The palindromic property of the new score guarantees that when two users are matched, their connection ID remains identical regardless of which user initiates the friendship request. The score must be returned as an integer and represent the smallest possible palindrome greater than the input value.
    

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