```python
def even_bit_set_number(n):
    """
    Sets all even bits of a given number.

    Even bits are at positions 0, 2, 4, etc., counting from the right.
    For example, for the number 10 (binary 1010), the even bits are at
    position 0 (value 0) and position 2 (value 0). Setting them results
    in binary 1111, which is 15.

    Args:
        n: A non-negative integer.

    Returns:
        An integer with all even bits set to 1.
    """
    # Create a mask with 1s at all even bit positions.
    # The mask needs to be at least as long as the number n.
    # n.bit_length() provides the number of bits in n.
    mask = 0
    
    # Iterate through even bit positions (0, 2, 4, ...)
    # up to the length of the number n.
    for i in range(0, n.bit_length(), 2):
        # Set the i-th bit in the mask by ORing with (1 << i).
        mask = mask | (1 << i)

    # The bitwise OR operation sets the bits in n that correspond to
    # the set bits in the mask, effectively setting all even bits.
    return n | mask
```