Given a NxN matrix, how could I find all possible paths to a location (i,i)?
===

Given a `NxN` matrix, how could I find all possible paths to a location (i,i). Navigation would be only `downwards` and towards the `right`.


P.S. Not a homework. 