The following figure is made with nine squares of length 1 cm each. A student is standing at point P. The total number of shortest paths to reach point Q from point P, if the student walks along the boundaries of the squares only, is: