Points: 3 (partial)
Time limit: 1.0s
Memory limit: 1G
Given a string, determine if it can be partitioned into two nonempty substrings, both of which are palindromes.
The only letters that appear are
The input consists of a single string of length .
If the string can be partitioned into two nonempty substrings, both of which are palindromes, output
Sample Input 1
Sample Output 1
Sample Input 2
Sample Output 2