Just wanted to add little bit complexity in what Harshita had mentioned. This might help you.
include <stdio.h>
int main()
{
int a[] = {1,3,3,1,3,4,4,6,1,6,1};
int n = sizeof(a)/sizeof(a[0]);
int i = 0, j = 0;
for(i = 0; i < n; i++){
for(j = i+1; j < n; j++){
if(a[i] == a[j]){
a[j] = -a[j];
break;
}
}
if(i != n-1){
printf("i %d\n",i);
if(a[i] != a[j]){
if(a[i] == -(a[j])){
continue;
}else if(a[i] < 0){
continue;
}else{
printf("Unique Number [%d]\n",a[i]);
break;
}
}
}else{
printf("Unique Number [%d]\n",a[i]);
break;
}
}
return 0;
}