```python
def odd_Equivalent(s,n):
    """
    Finds the count of rotations of a binary string with odd value.

    A binary number is odd if and only if its least significant bit (the last digit) is '1'.
    When a binary string is rotated, each of its original digits will appear in the
    last position exactly once across all possible rotations.
    Therefore, the number of rotations that result in an odd number is equal to the
    number of '1's in the original string.
    """
    return s.count('1')

```