
    Design an algorithm to determine the number of possible balanced learning paths, where each path consists of 2n learning modules, and each module is either easy (1) or challenging (0), such that the number of easy modules in the first half of the path equals the number of easy modules in the second half. This ensures students experience consistent difficulty levels throughout their learning journey.
    

    
def count_binary_seq(n):
    """
    Design an algorithm to determine the number of possible balanced learning paths, where each path consists of 2n learning modules, and each module is either easy (1) or challenging (0), such that the number of easy modules in the first half of the path equals the number of easy modules in the second half. This ensures students experience consistent difficulty levels throughout their learning journey.
    

    """
def count_binary_seq(n):
    """
    Design an algorithm to determine the number of possible balanced learning paths, where each path consists of 2n learning modules, and each module is either easy (1) or challenging (0), such that the number of easy modules in the first half of the path equals the number of easy modules in the second half. This ensures students experience consistent difficulty levels throughout their learning journey.
    

    """
    nCr = 1
    res = 1
    for r in range(1, n + 1):
        nCr = nCr * (n + 1 - r) / r
        res += nCr * nCr
    return res