jmc

There is 1 way to get from C to N. There is only one way to get from D to N, which is DCN. Since A can only go to C or D, which each only have 1 way to get to N each, there are $1+1=2$ ways to get from A to N. Since B can only go to A, C or N, and A only has 2 ways to get to N, C only has 1 way and to get from B to N is only 1 way, there are $2+1+1=4$ ways to get from B to N. M can only go to either B or A, A has 2 ways and B has 4 ways, so M has $4+2=6$ ways to get to N. 6 is $\boxed{6}$. A diagram labeled with the number of ways to get to $\text{N}$ from each point might look like