```python
def set_left_most_unset_bit(n):
    """
    Sets the left most unset bit of a non-negative integer.
    """
    if n < 0:
        raise ValueError("Input must be a non-negative integer")

    # If n is of the form 2^k - 1 (all ones up to its MSB),
    # the leftmost unset bit is the one just beyond the current MSB.
    # This condition also handles n=0.
    if (n & (n + 1)) == 0:
        return n | (n + 1)

    # For other numbers, there is an unset bit within the bit length of n.
    # Find the smallest power of 2 that is greater than n.
    # For n=10 (1010), bit_length=4, p=16 (10000).
    p = 1 << n.bit_length()

    # Create a mask of the unset bits by XORing n with a mask of all ones.
    # The mask of all ones up to n's length is p - 1.
    # For n=10, p=16, p-1=15 (1111).
    # unset_mask = 10 ^ 15 = 5 (0101).
    # The set bits in unset_mask correspond to the unset bits in n.
    unset_mask = (p - 1) ^ n

    # Find the most significant bit of the unset_mask.
    # This corresponds to the leftmost unset bit of n.
    # For mask=5 (0101), bit_length=3, MSB is at pos 2.
    # The value is 1 << (3-1) = 4.
    leftmost_unset_bit = 1 << (unset_mask.bit_length() - 1)

    # Set this bit in the original number and return.
    return n | leftmost_unset_bit
```