Implementation in Python 3.9.1

G. String Counting time limit per test 10 seconds memory limit per test: 1024 megabytes input standard input output standard output You have letters 'a', letters 'b'..... C26 letters 'z'. You want to build a beautiful string of length n from them (obviously, you cannot use the i-th letter more than a times). Each G is greater than A string is called beautiful if there are no palindromic contiguous substrings of odd length greater than 1 in it. For example, the string "abacaba" is not beautiful, it has several palindromic substrings of odd length greater than 1 (for example, "aca"). Another example: the string "abcaa" is beautiful Calculate the number of different strings you can build, and print the answer modulo 998244353 Input The first line contains one integer n (3