Assignment $-2$: Maze

Given a $nn$ matrix represented as a set of $($row$,$ col, val$),$ find the path starting

from $(1,1)$ to $(n,n).$ Each element of the matrix is given as bitwise$-$and of $4$

direction codes $($see figure below$).$

For example when a $33$ maze given as below,

the input and output data are as follows;