On a $5 \times 5$ grid, cover the area with several S-Tetrominos (also known as Z-Tetrominos) such that in every square, there are two or fewer tiles covering it (tiles can overlap). Determine the maximum possible number of squares that can be covered by at least one tile.

Let's think step by step and output the final answer within \boxed{}.
user