```python
import math

def count_binary_seq(n):
    """
    Finds the count of all binary sequences of length 2n such that the sum
    of the first n bits is the same as the sum of the last n bits.

    Args:
        n: A non-negative integer.

    Returns:
        The total count of such binary sequences.
    """
    if n < 0:
        return 0
    
    # The number of such sequences is given by the central binomial coefficient,
    # which is C(2n, n).
    # This is derived from the combinatorial identity:
    # sum_{k=0 to n} (C(n, k))^2 = C(2n, n)
    # where C(n, k) is the number of ways to choose k items from a set of n.
    # In this problem, k represents the sum of bits (number of 1s).
    return math.comb(2 * n, n)

```