public static int findLargestPalindrome(){

		int product;
		int highest = 0;
		for(int first = MAX; first > MIN; first--){
			boolean firstIteration = true;
			for(int second = first; second > MIN; second --){
				if(firstIteration){
					if(((first*second)<highest) && highest != 0){
						return highest;
					}
					firstIteration = false;
				}
				if(((first*second)<highest) && highest != 0){
					break;
				}
				product = first*second;
				if(product>highest){
					if(isPalindrome(product)){
						highest = product;
					}
				}
			}
		}
		return -1;
	}