Induction · Challenge problem

Every integer $n \ge N$ is of the form $4a + 7b$ ($a, b \ge 0$), with $N$ as small as possible. A strong-induction proof whose step adds a $4$ needs four base cases $N, N + 1, N + 2, N + 3$. What is the sum of these four base values?