private boolean isPrimeable(int n) {
		if (n < 10) {
			return true;
		}
		int[] numbers = Problem30.getNumbers(n);
		for (int i = 0; i < numbers.length; i++) {
			int x = numbers[i];
			switch (x) {
				case 1:
				case 3:
				case 7:
				case 9:
					break;
				default:
					return false;
			}
		}
		int mod = n % 6;
		if (mod == 5 || mod == 1) {
			return true;
		}
		return false;
	}