public static int montakoKivea(int[] kivet) {
	int outerIndex = 0;
	int innerIndex = 0;
	int pairsToBeRemoved = 0;

	while (outerIndex + 1 < kivet.length) {
		if (kivet[outerIndex] == kivet[outerIndex + 1]) {
			pairsToBeRemoved += 1;
			innerIndex = 1;
			while (outerIndex - innerIndex >= 0 && outerIndex + innerIndex + 1 < kivet.length) {
				if (kivet[outerIndex - innerIndex] != kivet[outerIndex + innerIndex + 1]) {
					break;
				}
				pairsToBeRemoved += 1;
				innerIndex += 1;
			}
		}
		outerIndex += 1 + innerIndex;
	}

	return kivet.length - 2 * pairsToBeRemoved;
}