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

    A binary number's value is odd if and only if its last digit (least
    significant bit) is '1'.

    When we perform all n rotations of a string of length n, the last character
    of each rotated string will correspond to one of the characters of the
    original string. The set of all last characters from the n rotations is
    simply a permutation of the characters in the original string.

    Therefore, the number of rotations that end in '1' (and thus have an odd
    value) is equal to the total number of '1's in the original string.

    Args:
        s: The binary string.
        n: The length of the string s.

    Returns:
        The count of rotations that represent an odd number.
    """
    
    # The number of odd-valued rotations is equal to the number of '1's
    # in the original string.
    ones_count = s.count('1')
    
    return ones_count

```