//#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<cmath>
#include<map>
#include<unordered_map>
#include<functional>
#include<queue>
#include<set>
#include<stack>
#include<iomanip>
#include<algorithm>
#include<numeric>
#include<memory>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(a)   a.begin(),a.end()
template<typename T =ll> using v = vector<T>;
template<typename T =ll> using vv = v<v<T>>;
template<typename T =ll,typename U =ll> using p = pair<T,U>;
template<typename T> T chmin(T &a,T b) {return a=min(a,b);}
template<typename T> T chmax(T &a,T b) {return a=max(a,b);}
const ll INF = (ll)1e9;
template <int MOD>
struct ModInt {
    using lint = long long;
    int val;

    // constructor
    ModInt(lint v = 0) : val(v % MOD) {
        if (val < 0) val += MOD;
    };

    // unary operator
    ModInt operator+() const { return ModInt(val); }
    ModInt operator-() const { return ModInt(MOD - val); }
    ModInt inv() const { return this->pow(MOD - 2); }

    // arithmetic
    ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }
    ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }
    ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }
    ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }
    ModInt pow(lint n) const {
        auto x = ModInt(1);
        auto b = *this;
        while (n > 0) {
            if (n & 1) x *= b;
            n >>= 1;
            b *= b;
        }
        return x;
    }

    // compound assignment
    ModInt& operator+=(const ModInt& x) {
        if ((val += x.val) >= MOD) val -= MOD;
        return *this;
    }
    ModInt& operator-=(const ModInt& x) {
        if ((val -= x.val) < 0) val += MOD;
        return *this;
    }
    ModInt& operator*=(const ModInt& x) {
        val = lint(val) * x.val % MOD;
        return *this;
    }
    ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); }
    //
    ModInt operator++(int) {
        auto t = *this;
        *this += 1;
        return t;
    }

    ModInt operator--(int) {
        auto t = *this;
        *this -= 1;
        return t;
    }
    ModInt operator<<(const int n){
        return ModInt(*this)*ModInt(2).pow(n);
    }
    // compare
    bool operator==(const ModInt& b) const { return val == b.val; }
    bool operator!=(const ModInt& b) const { return val != b.val; }

    // I/O
    friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept { return is >> x.val; }
    friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }
};

constexpr int MOD = 1e9 + 7;
using mint = ModInt<MOD>;

void a(){
   char A; cin >> A;
   if(A>='a'){
       cout << "a" <<endl;
   }else{
       cout << "A" << endl;
   }
}
void b(){
    ll N,K; cin >> N >> K;
    auto P = v<>(N,0);
    rep(i,N) cin >> P[i];
    sort(all(P));
    cout << accumulate(P.begin(),P.begin()+K,0);

}
void c(){
    ll N; cin >> N;
    ll X = 26;
    ll maxX=26;
    string ans;
    
    while(N){
        ans+=N%X==0?'z':N%X+'a'-1;
        N=(N-1)/X;
    }
    
    reverse(all(ans));
    cout << ans << endl;

}
void d(){
    ll N; cin >> N;
    auto A = v<>(1e5+1,0);
    ll sum=0;
    rep(i,N) {
        ll t; cin >> t;
        sum+=t;
        A[t]++;
    }
    
    ll Q;
    cin >> Q;
    
    rep(i,Q){
        ll B,C; cin >> B >> C;
        sum+=A[B]*C-A[B]*B;
        A[C]+=A[B];
        A[B]=0;
        cout << sum << endl;
    } 

}
void e(){
    ll N; cin >> N;
    auto A = v<>(N,0);
    ll sum =0;
    rep(i,N) {
        cin >> A[i];
        sum^=A[i];
    }

    rep(i,N){
        cout << (sum^A[i]) << ' ';
    }

}

int main(){
    e();
}


Measured memory_bytes: 4764