
    Design a function for the friend recommendation system that determines the highest connection tier (represented as powers of 2) based on the number of mutual connections between users, where each tier represents increasingly strong recommendation levels. The connection tier must be the largest power of 2 that doesn't exceed the total number of mutual connections between the users. For example, 7 mutual connections would map to tier 4 (2^2), while 10 mutual connections would map to tier 8 (2^3).
    

    
def highest_Power_of_2(n):
    """
    Design a function for the friend recommendation system that determines the highest connection tier (represented as powers of 2) based on the number of mutual connections between users, where each tier represents increasingly strong recommendation levels. The connection tier must be the largest power of 2 that doesn't exceed the total number of mutual connections between the users. For example, 7 mutual connections would map to tier 4 (2^2), while 10 mutual connections would map to tier 8 (2^3).
    

    """
def highest_Power_of_2(n):
    """
    Design a function for the friend recommendation system that determines the highest connection tier (represented as powers of 2) based on the number of mutual connections between users, where each tier represents increasingly strong recommendation levels. The connection tier must be the largest power of 2 that doesn't exceed the total number of mutual connections between the users. For example, 7 mutual connections would map to tier 4 (2^2), while 10 mutual connections would map to tier 8 (2^3).
    

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