@Override
	public int question() {
		int product = 0;
		Vector<Integer> set = new Vector<Integer>();

		for(int i = 999; i > 0; i--){
			for (int j = 999; j > 0; j--){
				product = i*j;
				if (product == reversal(product)){
					set.add(product);
				}
			}
		}
		Collections.sort(set);
		return set.lastElement();
	}