
    Given a user's content engagement score, develop a function that determines the next highest possible score achievable by rearranging its digits, which will be used to adjust content ranking priority in the recommendation feed. The new score must be the smallest possible number greater than the original score using the exact same digits, ensuring optimal content positioning while maintaining the integrity of the engagement metrics.
    

    
def rearrange_bigger(n):
    """
    Given a user's content engagement score, develop a function that determines the next highest possible score achievable by rearranging its digits, which will be used to adjust content ranking priority in the recommendation feed. The new score must be the smallest possible number greater than the original score using the exact same digits, ensuring optimal content positioning while maintaining the integrity of the engagement metrics.
    

    """
def rearrange_bigger(n):
    """
    Given a user's content engagement score, develop a function that determines the next highest possible score achievable by rearranging its digits, which will be used to adjust content ranking priority in the recommendation feed. The new score must be the smallest possible number greater than the original score using the exact same digits, ensuring optimal content positioning while maintaining the integrity of the engagement metrics.
    

    """
    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