public static boolean isPalindrome(int input) {
		List<Integer> intList = new ArrayList<Integer>();
		int procInt = input;

		// While int being processed is greater than zero,
		// get last digit from the int and add to the list.
		while(procInt > 0) {
			intList.add(procInt%10);
			procInt = procInt/10;
		}

		// Take each digit from the intList and build
		// a new number from it in reverse order
		// from the input.
		int tmp = 0;
		int count = 0;
		for(int j:intList) {
			if(j == 0 && count == 0) {
				break;
			}
			System.out.println("j: " + j);
			System.out.println("tmp*10 : " + (tmp*10));
			tmp = j + (tmp*10);
			System.out.println(tmp + "!!\n");
			count++;
		}

		if(input != tmp)
			return false;

		return true;
	}