I dont understand that part when we backtrack in N queen problem

I understood the code till the part when we are marking true in the matrix and calling the function recursively but I dont understand that how it backtrack when column value reaches the length.

Hi Shantanu,
See in N queen problem we make a box true if it is safe to place queen there and then make a recursive call and if we are able to place all the n queens on the chess board by fixing one queen at this particular box then our function returns 1 as it is one way to place all the n queens now since our task is to find all the ways or orientations in which we can place n queens on a given chessboard we have to take out queen from this particular box which we had previously marked true so for this we marked this box false and thus checks for other orientations possible.