```python
def highest_Power_of_2(n):
    if n < 1:
        return 0
    # Find the position of the most significant bit (MSB).
    # n.bit_length() returns the number of bits required to represent n.
    # For n=10 (1010 in binary), bit_length is 4. The MSB is at position 3 (0-indexed).
    # The highest power of 2 is 2 raised to the power of the MSB's position.
    power = n.bit_length() - 1
    # Calculate 2**power using a bit shift for efficiency.
    return 1 << power
```