
    Design a function for the event recommendation engine that generates the next closest event ID by rearranging the digits of a current event's identifier, ensuring the suggested event is the smallest possible number larger than the current ID. The new event ID must use exactly the same digits as the original to maintain relevance within the same interest category while providing a different but related recommendation to the user.
    

    
def rearrange_bigger(n):
    """
    Design a function for the event recommendation engine that generates the next closest event ID by rearranging the digits of a current event's identifier, ensuring the suggested event is the smallest possible number larger than the current ID. The new event ID must use exactly the same digits as the original to maintain relevance within the same interest category while providing a different but related recommendation to the user.
    

    """
def rearrange_bigger(n):
    """
    Design a function for the event recommendation engine that generates the next closest event ID by rearranging the digits of a current event's identifier, ensuring the suggested event is the smallest possible number larger than the current ID. The new event ID must use exactly the same digits as the original to maintain relevance within the same interest category while providing a different but related recommendation to the user.
    

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