How many distinct permutations of the letters of the word REDDER are there that do not contain a
palindromic substring of length at least two? (A substring is a contiguous block of letters that is part
of the string. A string is palindromic if it is the same when read backwards.)