public static void firstPalindrome(int num) {
		int forward = num;
		int backward = num;
		int countf = 0;
		int countb = 0;
		while (!isPalindrome(forward) && !isPalindrome(backward)) {
			countf++;
			countb++;
			forward++;
			backward--;
		}
		if (isPalindrome(forward)) {
			countb++;
		}
		if (isPalindrome(backward)) {
			countf++;
		}
		if (countf == countb) {
			System.out.println(forward + " " + backward);
		}
		if (countf > countb) {
			System.out.println(backward);
		}
		if (countf < countb) {
			System.out.println(forward);
		}
	}