You have c1 letters 'a', c2 letters 'b', ..., c26 letters 'z'. You need to construct a lovely line of length n from them (clearly, you can't utilize the I-th letter more than ci occasions). Every ci is more noteworthy than n3. A string is called delightful in case there are no palindromic coterminous substrings of odd length more prominent than 1 in it. For instance, the string "abacaba" isn't
Correct answer will be upvoted else downvoted. Computer science.
You have c1 letters 'a', c2 letters 'b', ..., c26 letters 'z'. You need to construct a lovely line of length n from them (clearly, you can't utilize the I-th letter more than ci occasions). Every ci is more noteworthy than n3.
A string is called delightful in case there are no palindromic coterminous substrings of odd length more prominent than 1 in it. For instance, the string "abacaba" isn't wonderful, it has a few palindromic substrings of odd length more noteworthy than 1 (for instance, "aca"). Another model: the string "abcaa" is wonderful.
Work out the number of various strings you can assemble, and print the appropriate response modulo 998244353.
Input
The main line contains one integer n (3≤n≤400).
The subsequent line contains 26 integers c1, c2, ..., c26 (n3<ci≤n).
Output
Print one integer — the number of strings you can construct, taken modulo 998244353.
Step by step
Solved in 4 steps with 1 images
