Zoli wants to fill the given $4 \times 4$ table with the digits $1$, $2$, $3$ and $4$, such that in every row and column, and also in the diagonal going from the top left cell to the bottom right, each digit appears exactly once. What is the highest possible value of the sum of the digits in the six grey cells?
