public static int sb(int base, int[] is) {
		if (is[0] == Cb[0] && is[1] == Cb[1] && is[2] == Cb[2] && is[3] == Cb[3] && is[4] == Cb[4])
			return 0;
		int[] inc = sortInc(is);
		
		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;
			}
		}
		return 1+sb(base, diff);
	}