#include<iostream>
#include<algorithm>
using namespace std;
void Find(int data[],int n,int* num1,int* num2) {
int x=0;
for (int i = 0; i < n;i++) {
x ^= data[i] ;
}
int t = 1;
while ((x&t)==0){
t <<= 1;
}
for (int j = 0; j < n; j++){
if ((data[j]&t)==0) *num1 ^= data[j];
else *num2 ^= data[j];
}
}
int main() {
int a[] = {2,4,3,6,3,2,5,5};
int p=0, q = 0;
int *num1=&p, *num2=&q;
Find(a,8,num1,num2);
cout << *num1 << endl << *num2 << endl;
return 0;
}