Given a string formed only with 4 different letters, how many permutations of it exist with no two consecutive letters?

Question

Given a string S, formed with the letters A, B, C, D, each occurring at most 10 times in S How many permutations of S do not contain