class IsAPalindromeByRecursion {
  
    static boolean testPalindrome(final String s) {
    
      if (s.length() >= 2) {
        if (s.charAt(0) == s.charAt(s.length() - 1))
          return testPalindrome(s.substring(1, s.length() - 1));
        else
          return false;
      } else
        return true; /* e' un palindromo */
    }
  
    public static void main(String[] arguments) {
      String stringhe[] = {"ABCD    DCBA", "aBccba"};
      int i;
      
      for (i = 0; i < stringhe.length; i++) {
        System.out.print("La stringa \"" + stringhe[i] + "\"");
        if (testPalindrome(stringhe[i]) == false)
          System.out.print(" non");
        System.out.println(" e` un palindromo");
      }
    }
}