for (i=1; i++; i<n)
{
chislo = massiv[i];
k=0;
while (massiv[k] ==chislo)
{
k++
}
if k%2!=0 нашли
else i=k+1
}