A corner with arm $n$ is a figure made of $2n-1$ unit squares, such that 2 rectangles $1$ x $(n-1)$ are connected to two adjacent sides of a square $1$ x $1$, so that their unit sides coincide. The squares or a chessboard $100$ x $100$ are colored in 15 colors. We say that a corner with arm 8 is “multicolored”, if it contains each of the colors on the board. What’s the greatest number of corners with arm 8 which could be “mutlticolored”?