public static int solution() {

		ArrayList<Integer> abdudant = new ArrayList<Integer>();
		for (int i = 1; i < 30000; i++) {
			if (divisorSum(i) > i)
				abdudant.add(i);
		}
		boolean[] tall = new boolean[28123];
		for (int i = 0; i < abdudant.size(); i++) {
			int first = abdudant.get(i);
			if (first*2 >= tall.length)
				break;
			for (int j = i; j < abdudant.size(); j++) {
				if (first + abdudant.get(j) < tall.length)
					tall[first + abdudant.get(j)] = true;
			}
		}
		
		int sum = 0;
		for (int i = 0; i < tall.length; i++) {
			if (!tall[i])
				sum+=i;
		}
		
		return sum;
	}