```python
def count_binary_seq(n):
    """
    Calculates 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.

    The problem is equivalent to finding the central binomial coefficient C(2n, n).
    C(2n, n) = (2n)! / (n! * n!)
    This can be calculated iteratively to avoid large intermediate numbers.
    """
    # Initialize result to 1 for the multiplicative identity.
    # This also correctly handles the n=0 case, as the loop will not run and 1 will be returned.
    # C(0, 0) = 1.
    result = 1
    
    # The loop calculates C(2n, n) = (2n * (2n-1) * ... * (n+1)) / n!
    for i in range(n):
        # In each step, we multiply by the next term from the numerator (2n - i)
        # and divide by the next term from the denominator (i + 1).
        # Using integer division // is safe because the intermediate result
        # C(2n, i+1) is always an integer.
        result = result * (2 * n - i) // (i + 1)
        
    return result

```