```python
def count_With_Odd_SetBits(n):
    s = bin(n)[2:]
    length = len(s)
    memo = {}

    def solve(pos, tight, parity):
        """
        Recursively counts numbers with the given properties.
        - pos: current bit position from the left (0-indexed).
        - tight: boolean, True if we are restricted to the digits of n.
        - parity: the parity of set bits in the prefix constructed so far (0 for even, 1 for odd).
        """
        if pos == length:
            return parity

        state = (pos, tight, parity)
        if state in memo:
            return memo[state]

        res = 0
        limit = int(s[pos]) if tight else 1

        for digit in range(limit + 1):
            new_tight = tight and (digit == limit)
            new_parity = parity ^ digit
            res += solve(pos + 1, new_tight, new_parity)
        
        memo[state] = res
        return res

    return solve(0, True, 0)

```