For this Question: You are given an array A, you need to create an array B such that B(i) is the Xor of all the elements of A except A(i).The first line of the input contains an integer N, the number of elements in array A.
The second line of input contains N singly spaced integers, the elements of the array A.

Constraints
1 <= N <= 300000
0 <= A(i) <= 1000000000Output the required array B.Sample Input
4
3 5 7 6

Sample Output
4 2 0 1

Explanation:
B(0) = 5^7^6 = 4
B(1) = 3^7^6 = 2
B(2) = 3^5^6 = 0
B(3) = 3^5^7 = 1, I have written this Solution Code: #include <iostream>
using namespace std;

int main()
 {
	
    int n;
    cin>>n;
    int a[n];
    int i,j;
    for(i=0;i<n;i++)
        cin>>a[i];
    int xor1=0;
    for(i=0;i<n;i++)
        xor1=xor1^a[i];
    for(i=0;i<n;i++)
        cout<<(xor1^a[i])<<" ";
    cout<<endl;
	return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?