
    Given a cluster of n users in a social network, determine the largest group size (which must be a power of 2) that can be used to process friend recommendations without splitting any existing interaction patterns. The group size should be the highest power of 2 that does not exceed the total number of users n, ensuring optimal batch processing for the recommendation system.
    

    
def highest_Power_of_2(n):
    """
    Given a cluster of n users in a social network, determine the largest group size (which must be a power of 2) that can be used to process friend recommendations without splitting any existing interaction patterns. The group size should be the highest power of 2 that does not exceed the total number of users n, ensuring optimal batch processing for the recommendation system.
    

    """
def highest_Power_of_2(n):
    """
    Given a cluster of n users in a social network, determine the largest group size (which must be a power of 2) that can be used to process friend recommendations without splitting any existing interaction patterns. The group size should be the highest power of 2 that does not exceed the total number of users n, ensuring optimal batch processing for the recommendation system.
    

    """
    res = 0
    for i in range(n, 0, -1):
        if i & i - 1 == 0:
            res = i
            break
    return res