public static int[] getNeighboorsSlow(final int nb) {
		final int result[] = new int[36];

		final int v1 = nb % 10;
		int root = nb - v1;
		int cpt = 0;
		for (int i = 0; i < 10; i++) {
			final int candidat = root + i;
			if (candidat == nb) {
				continue;
			}
			result[cpt++] = candidat;
		}
		final int v2 = (nb / 10) % 10;
		root = nb - v2 * 10;
		for (int i = 0; i < 10; i++) {
			final int candidat = root + i * 10;
			if (candidat == nb) {
				continue;
			}
			result[cpt++] = candidat;
		}
		final int v3 = (nb / 100) % 10;
		root = nb - v3 * 100;
		for (int i = 0; i < 10; i++) {
			final int candidat = root + i * 100;
			if (candidat == nb) {
				continue;
			}
			result[cpt++] = candidat;
		}
		final int v4 = nb / 1000;
		root = nb - v4 * 1000;
		for (int i = 0; i < 10; i++) {
			final int candidat = root + i * 1000;
			if (candidat == nb) {
				continue;
			}
			result[cpt++] = candidat;
		}
		return result;
	}