An L-shaped figure composed of $4$ unit squares (such as shown in the picture) we call L-dominoes. Determine the maximum number of L-dominoes that can be placed on a board of dimensions $n \times n$, where $n$ is natural number, so that no two dominoes overlap and it is possible get from the upper left to the lower right corner of the board by moving only across those squares that are not covered by dominoes. (By moving, we move from someone of the square on it the neighboring square, i.e. the square with which it shares the page). Note: L-Dominoes can be rotated as well as flipped, giving an symmetrical figure wrt axis compared to the one shown in the picture.