
    Given a student's performance score, find the next highest score that reads the same forwards and backwards to establish their next balanced learning benchmark. The score must be greater than the student's current performance score and should be the smallest such number that satisfies the palindrome condition.
    

    
import sys

def next_smallest_palindrome(num):
    """
    Given a student's performance score, find the next highest score that reads the same forwards and backwards to establish their next balanced learning benchmark. The score must be greater than the student's current performance score and should be the smallest such number that satisfies the palindrome condition.
    

    """
import sys

def next_smallest_palindrome(num):
    """
    Given a student's performance score, find the next highest score that reads the same forwards and backwards to establish their next balanced learning benchmark. The score must be greater than the student's current performance score and should be the smallest such number that satisfies the palindrome condition.
    

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