class euler4 {
	public static boolean isPal(int number) {
		String num = number + "";
		int numLen = num.length();
		if(num.length() == 6) {
			String half1 = num.substring(0, numLen/2);
			String half2 = num.substring(numLen/2, numLen);
			System.out.println(half1 + "\t" + half2);
		}
		return true;
	}

	public static int largestPalindrome() {
		int factor1 = 999;
		int factor2 = 999;
		int product;
		while(factor1 >= 100) {
			while(factor2 >= 100) {
				product = factor1 * factor2;
			}
		}
		return 0;
	}

	public static void main(String[] args) {
		isPal(261162);
	}
}
