public static void main(String[] args) {
		int numeratorProduct = 1;
		int denominatorProduct = 1;
		for (int n = 10; n < 99; n++)
			for (int d = n + 1; d < 100; d++)
				if (digitCancelledFraction(n, d)){
					numeratorProduct *= n;
					denominatorProduct *= d;
				}
				
		ArrayList<Integer> numPrimeFactors = primeFactorization(numeratorProduct);
		ArrayList<Integer> denPrimeFactors = primeFactorization(denominatorProduct);
		for (Integer numPrimeFactor: numPrimeFactors)
			if (denPrimeFactors.contains(numPrimeFactor))
				denPrimeFactors.remove(numPrimeFactor);
		int denominator = 1;
		for (Integer denPrimeFactor: denPrimeFactors)
			denominator *= denPrimeFactor;
		System.out.println(denominator);
		// Solution: 100
	}