PalindromeInteger

import java.util.Arrays;
import java.util.Scanner;

public class PalindromeIntegers {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String numbers = scanner.nextLine();
            if (numbers.equals("END")) {
                break;
            }
            char[] number = numbers.toCharArray();
            boolean isPalindrome = PalindromeFinder(number);

            if (isPalindrome) {
                System.out.println("true");
            } else {
                System.out.println("false");
            }
        }
    }

    private static boolean PalindromeFinder(char[] number) {
        char[] secondNumber = new char[number.length];
        int counter = 0;

        for (int i = number.length - 1; i >= 0; i--) {
            for (int j = counter; j < counter + 1; j++) {
                secondNumber[j] = number[i];
            }
            counter++;
            if (counter == number.length) {
                break;
            }
        }

        if (Arrays.equals(secondNumber, number)) {
            return true;
        }

        return false;

    }
}