def odd_bit_set_number(n):
    mask = 0
    bit = 1
    position = 1
    while bit <= n:
        if position % 2 == 1:  # odd position (1-indexed)
            mask |= bit
        bit <<= 1
        position += 1
    # Also handle bits beyond n's length
    # We need to set all odd bits up to the highest bit of n
    # Let's recalculate properly
    mask = 0
    temp = n
    bit = 1
    pos = 1
    while bit <= n or pos <= n.bit_length():
        if pos % 2 == 1:
            mask |= bit
        bit <<= 1
        pos += 1
        if bit > n and pos > n.bit_length():
            break
    return n | mask

def odd_bit_set_number(n):
    # Set all odd bits (1st, 3rd, 5th, ... bits from right, 1-indexed)
    num_bits = n.bit_length()
    mask = 0
    for i in range(1, num_bits + 1):
        if i % 2 == 1:  # odd position
            mask |= (1 << (i - 1))
    return n | mask