public class Palindrome  // determine if a String is a palindrome using recursion
{
	public static void main(String[] args)
	{			// test cases
		String[] strings={"abcba", "abcdeabc", "abababa", "abccba", "abacbaba", "abacadacaba"};
		for(int i=0;i<strings.length;i++)		// try each testcase, outputs those Strings that are determined to be palindromes
			if(isPalindrome(strings[i])) System.out.println(strings[i]);
	}
	
	public static boolean isPalindrome(String x)		// recursive boolean method, is x is a palindrome?
	{													// we will recursively pair up the 0th and last characters if they are the same until we reach 1 or 0 character or have a mismatch
		if(x.length()==0||x.length()==1) return true;	// base case:  paired the String down to 0 or 1 character, so palindrome, return true
		else if(x.charAt(0)!=x.charAt(x.length()-1)) return false;	// else if the current 0th and last characters are not the same then mismatch, not a palindrome
		else return isPalindrome(x.substring(1,x.length()-1));	// else current 0th and last characters are the same, return what we get when recursively calling the method with the rest of the String
	}
}