Next, compute the number of paths that pass through the forbidden square at (3,3). To do this, split the path into two parts: from (1,1) to (3,3), and from (3,3) to (5,5). - Crankk.io