For how many paths comsisting of a sequence of horizontal and/or vertical line segments, with each segment connecting a pair of adjacent letters in the diagram below, is the word $\textup{OLYMPIADS}$ spelled out as the path is traversed from beginning to end? $\begin{tabular}{ccccccccccccccccc}& & & & & & & & O & & & & & & & &\\ & & & & & & & O & L & O & & & & & & &\\ & & & & & & O & L & Y & L & O & & & & & &\\ & & & & & O & L & Y & M & Y & L & O & & & & &\\ & & & & O & L & Y & M & P & M & Y & L & O & & & &\\ & & & O & L & Y & M & P & I & P & M & Y & L & O & & &\\ & & O & L & Y & M & P & I & A & I & P & M & Y & L & O & &\\ & O & L & Y & M & P & I & A & D & A & I & P & M & Y & L & O &\\ O & L & Y & M & P & I & A & D & S & D & A & I & P & M & Y & L & O \end{tabular}$