public class Palindrome {
	static void printWord(char[] word) {
		for(int i=0; i<word.length; i++) {
			System.out.print(word[i]);
		}
		System.out.println();
	}
	
	static void printWords(char[][] words) {
		for(int i=0; i<words.length; i++) {
			printWord(words[i]);
		}
	}
	
	static boolean isPalindrome(char[] word) {
		for(int i=0; i<word.length/2; i++) {
			if(word[i] != word[word.length - i -1]) {
				return false;
			}
		}
		return true;
	}
	
	static void printPalindromes(char[][] words) {
		for(int i=0; i<words.length; i++) {
			if(isPalindrome(words[i])) {
				printWord(words[i]);
			}
		}
	}
	
	static void reverseWord(char[] word) {
		for(int i=0; i<word.length/2; i++) {
			char tmp = word[i];
			word[i] = word[word.length - i -1];
			word[word.length - i - 1] = tmp;
		}
	}
	
	static void reverseWords(char[][] words) {
		for(int i=0; i<words.length; i++) {
			reverseWord(words[i]);
		}
	}
	
	public static void main(String[] args) {
		char words[][] = {
				{ 'a', 'n', 'i', 'm', 'a', 'l' },
				{ 'r', 'a', 'd', 'a', 'r' },
				{ 'r', 'e', 's', 'u', 'm', 'a' },
				{ 'r', 'e', 's', 's', 'a', 's', 's', 'e', 'r' },
				{ 'r', 'e', 'l', 'a', 'c', 'e', 'r' },
				{ 'k', 'a', 'y', 'a', 'k' },
				{ 'v', 'i', 'v', 'e', ' ', 'J', 'a', 'v', 'a', ' ', '!' }
		};
		
		System.out.println("---- palindromes ---");
		printPalindromes(words);
		System.out.println("---- anacycliques ---");
		reverseWords(words);
		printWords(words);
	}

}