
    Given the total number of potential event matches found for a user in a social networking platform, determine the largest group size (which must be a power of 2) that can be formed without excluding any matches for efficient batch processing. For example, if there are 75 potential matches, the function should return 64 as the optimal group size, as it's the largest power of 2 that doesn't exceed the total number of matches.
    

    
def highest_Power_of_2(n):
    """
    Given the total number of potential event matches found for a user in a social networking platform, determine the largest group size (which must be a power of 2) that can be formed without excluding any matches for efficient batch processing. For example, if there are 75 potential matches, the function should return 64 as the optimal group size, as it's the largest power of 2 that doesn't exceed the total number of matches.
    

    """
def highest_Power_of_2(n):
    """
    Given the total number of potential event matches found for a user in a social networking platform, determine the largest group size (which must be a power of 2) that can be formed without excluding any matches for efficient batch processing. For example, if there are 75 potential matches, the function should return 64 as the optimal group size, as it's the largest power of 2 that doesn't exceed the total number of matches.
    

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