```python
import math

def set_Bit_Number(n):
    """
    Finds the most significant bit number which is also a set bit.

    Args:
        n: A non-negative integer.

    Returns:
        The 0-indexed position of the most significant set bit.
        Returns -1 if the input is 0, as it has no set bits.
    """
    if n <= 0:
        return -1
    
    # The position of the most significant bit is equivalent to
    # the floor of the base-2 logarithm of the number.
    # For example, for n=10 (binary 1010), log2(10) is approx 3.32.
    # The floor is 3, which is the correct position of the MSB.
    position = math.floor(math.log2(n))
    
    return position

```