```python
def even_bit_toggle_number(n):
    # A mask with 1s at even bit positions (0, 2, 4, ...) is required.
    # We build this mask to be large enough to cover all bits of n.
    # The XOR operation (^) will then toggle the bits of n where the mask is 1.

    # Handle n=0 as a special case, as its bit_length is 0.
    # Toggling the 0th bit of 0 (binary 0) should result in 1 (binary 1).
    if n == 0:
        return 1

    mask = 0
    # n.bit_length() gives the number of bits needed to represent n.
    # For example, for n=10 (binary 1010), bit_length is 4.
    # We iterate through the even bit positions up to this length.
    # The range function with a step of 2 (0, 2, 4, ...) is perfect for this.
    for bit_position in range(0, n.bit_length(), 2):
        # Set the bit at the current even position in the mask.
        # (1 << bit_position) creates a number with only that bit set.
        # The bitwise OR operator (|) adds this bit to the mask.
        mask |= (1 << bit_position)

    return n ^ mask
```