```python
def count_Set_Bits(n):
    """
    Counts the number of set bits (1s) in the binary representation of a non-negative integer.
    """
    if n < 0:
        # The concept of set bits for negative numbers depends on the chosen
        # representation (e.g., two's complement) and bit width, which are not
        # specified. We handle non-negative integers as is standard for this problem.
        # Returning 0 or raising an error are possible ways to handle this.
        # Let's raise a ValueError for clarity.
        raise ValueError("Input must be a non-negative integer.")

    # bin(n) converts the integer n to its binary string representation,
    # prefixed with '0b'. For example, bin(13) returns '0b1101'.
    binary_string = bin(n)

    # The string's count() method is used to count the occurrences of '1'.
    return binary_string.count('1')

```