JMO 2016

For $1\leq n\leq 2016$ , how many integers $n$ satisfying the condition: the reminder divided by $20$ is smaller than the one divided by $16$ .

There is a $11\times 11$ square grid. We divided this in $5$ rectangles along unit squares. How many ways that one of the rectangles doesn't have a edge on basic circumference. Note that we count as different ways that one way coincides with another way by rotating or reversing.