
    In an automated essay grading system, develop a function that determines the next possible higher score by rearranging the digits of a student's current numerical grade. The function should find the smallest score that is greater than the current score while using exactly the same digits, ensuring fair and consistent grade adjustments within the assessment framework.
    

    
def rearrange_bigger(n):
    """
    In an automated essay grading system, develop a function that determines the next possible higher score by rearranging the digits of a student's current numerical grade. The function should find the smallest score that is greater than the current score while using exactly the same digits, ensuring fair and consistent grade adjustments within the assessment framework.
    

    """
def rearrange_bigger(n):
    """
    In an automated essay grading system, develop a function that determines the next possible higher score by rearranging the digits of a student's current numerical grade. The function should find the smallest score that is greater than the current score while using exactly the same digits, ensuring fair and consistent grade adjustments within the assessment framework.
    

    """
    nums = list(str(n))
    for i in range(len(nums) - 2, -1, -1):
        if nums[i] < nums[i + 1]:
            z = nums[i:]
            y = min(filter(lambda x: x > z[0], z))
            z.remove(y)
            z.sort()
            nums[i:] = [y] + z
            return int(''.join(nums))
    return False