```python
def highest_Power_of_2(n):
    """
    Finds the highest power of 2 that is less than or equal to n.
    """
    # Powers of 2 are positive, so for n < 1, there is no solution.
    # Returning 0 is a sensible default for non-positive n.
    if n < 1:
        return 0

    # Start with the smallest power of 2, which is 1 (2^0).
    power_of_2 = 1

    # Keep doubling the power of 2 as long as the next power
    # does not exceed n.
    while (power_of_2 * 2) <= n:
        power_of_2 *= 2
    
    return power_of_2
```