public int find(int[] sequence) {
		int count = 0;
		boolean distinct = false;
		for (int i = 0; i < sequence.length - 1; i++) {
			for (int j = i + 1; j < sequence.length; j++) {
				if (sequence[i] != sequence[j]) {
					count++;
				} else {
					distinct = true;
				}
			}
		}
		return count + (distinct ? 1 : 0);
	}