Counting balanced structures

Balanced brackets, binary trees, triangulations, non-crossing pairings: one sequence, C_n = C(2n,n) - C(2n,n+1). The subtraction removes the structures whose running balance dips negative — a bijection to unrestricted paths ending one step off. Precompute factorials once; each query is O(1).