def even_bit_toggle_number(n):
    mask = 0
    bit = 2  # Start from bit position 1 (value 2), which is the first "even" bit
    temp = n
    pos = 1
    while temp > 0 or bit <= n:
        if pos % 2 == 0:  # even bit positions (2nd, 4th, 6th...)
            mask |= bit
        bit <<= 1
        pos += 1
        temp >>= 1
        if bit > n and temp == 0:
            break
    
    # Recalculate properly
    mask = 0
    bit = 2
    while bit <= n:
        mask |= bit
        bit <<= 2
    
    # Also need to handle case where n=0
    if n == 0:
        return 2  # toggle bit at position 1 (0-indexed even positions: 0, 2, 4... or 1, 3, 5...?)
    
    return n ^ mask

def even_bit_toggle_number(n):
    # Even bits: positions 1, 3, 5, ... (0-indexed) i.e., values 2, 8, 32, ...
    # Or even bit positions 0, 2, 4, ... i.e., values 1, 4, 16, ...
    # Let's try: even positions are 0, 2, 4, ... (values 1, 4, 16, 64, ...)
    mask = 0
    pos = 0
    bit = 1
    while bit <= n:
        if pos % 2 == 0:
            mask |= bit
        bit <<= 1
        pos += 1
    
    return n ^ mask