A goofy robot named Zippity only speaks using \(0\)s and \(1\)s. Every message Zippity sends is made of \(10\) digits. How many different \(10\)-digit messages can Zippity send if each message must include exactly one run of five zeros in a row? For example, \(0011000001\) would count as a valid message, but not \(1001010001\).