public int Problem41() {
		for (int n=9;n>=1;n--) {
			int[] digits = new int[n];
			for (int i=0;i<digits.length;i++) {
				digits[i]=i+1;
			}
			int result=-1;
			do {
				if(Utility.isPrime(Utility.toInteger(digits))) {
					result = Utility.toInteger(digits);
				}
			}while (Utility.nextPermutation(digits));
			if (result!=-1) {
				return result;
			}
		}
		throw new RuntimeException("Not Found");
	}