public static int sb(int[] inc) {
		if (inc[0] == Cb[0] && inc[1] == Cb[1] && inc[2] == Cb[2] && inc[3] == Cb[3] && inc[4] == Cb[4])
			return 0;
		Arrays.sort(inc);
		long memo = code(inc);
		if (COUNT.containsKey(memo)) {
			return COUNT.get(memo);
		}
		
		int[] diff = new int[5];
		for (int i = 4; i >= 0; i--) {
			diff[i] += inc[4-i]-inc[i];
			if (diff[i] < 0) {
				diff[i-1]--;
				diff[i] += base;
			}
		}
		int count = 1+sb(diff);
		COUNT.put(memo, count);
		return count;
	}