Jack, the painter, wants to paint three $1\times 1$ squares of a $11\times 11$ grid with red color. What is the number of ways in which he can do so such that each red square shares at least one vertex with at least one red square?

Your answer seems reasonable.
Find out if you're right!