Problem Statement

Counting Happy Ice Cream Wrapper Strings Swaraj and his friends have gone on a drive, happily listening to music and chatting with each other. Now they have stopped by an ice cream parlour and want to eat ice cream. Each ice cream wrapper has a string written on it, consisting of uppercase English letters. Their mood (happy or sad) changes based on the letters they read on the wrapper: H: Always makes them happy. S, D: Always makes them sad. Vowels (A, E, I, O, U): Flip their current mood (happy becomes sad; and vice versa). Other consonants: Do not change their mood. Initially, they are happy. Given an integer N , representing the length of the string on the wrapper, count how many strings of length N will make them happy after reading the entire string. Print the answer modulo 10 9 + 7 . Input Format A single integer N , representing the length of the string. Output Format A single integer, the number of strings that will make them happy, modulo 10 9 + 7 . Constraints 1 ≤ N ≤ 10 5 Ex