For a family $A\subseteq\left\{ 0,\dots,k\right\} ^{n}$, define the $δ$-shadow of $A$ to be the set obtained from $A$ by removing from any of its vectors one coordinate that equals zero. Given the size of $A$, how should we choose $A$ to minimise its $δ$-shadow? Our aim in this paper is to show that, for any $r$, the family of all sequences with at most $r$ zeros has minimal $δ$-shadow. We actually give the exact best $A$ for every size.