#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cassert>
#include <cstddef>
#include <cstdint>
#include <stdexcept>
#include <utility>
#include <vector>

template <class Integral, ::std::size_t Bitlength, Integral None>
class wavelet_matrix {
public:
	using value_type = Integral;
	using size_type = ::std::size_t;
	static constexpr value_type none = None;

private:
	using bitfield = ::std::uint_least64_t;
	static constexpr ::std::size_t wardsize = 64;
	static ::std::size_t popcount(bitfield c) {
#ifdef __has_builtin
		return __builtin_popcountll(c);
#else
		c = (c & 0x5555555555555555ULL) + (c >> 1 & 0x5555555555555555ULL);
		c = (c & 0x3333333333333333ULL) + (c >> 2 & 0x3333333333333333ULL);
		c = (c + (c >> 4)) & 0x0F0F0F0F0F0F0F0FULL;
		return static_cast<::std::size_t>(c * 0x0101010101010101ULL >> 56 & 0x7f);
#endif
	}
	class bitvector {
		::std::vector<::std::pair<bitfield, size_type>> dic;

	public:
		size_type cnt;
		value_type bit;
		bitvector() {}
		bitvector(const size_type size) : dic(size / wardsize + 1, { 0, 0 }) {}
		void set(const size_type index) {
			dic[index / wardsize].first |= static_cast<bitfield>(1)
				<< (index % wardsize);
		}
		void build() {
			const size_type len = dic.size();
			for (size_type i = 1; i < len; ++i)
				dic[i].second = dic[i - 1].second + popcount(dic[i - 1].first);
		}
		size_type rank(const size_type last) const {
			return dic[last / wardsize].second +
				popcount(dic[last / wardsize].first &
				(static_cast<bitfield>(1) << (last % wardsize)) - 1);
		}
		bool access(const size_type index) const {
			return dic[index / wardsize].first >> (index % wardsize) & 1;
		}
	};
	static bool valid(const value_type value) {
		return value == none || !(value >> (Bitlength - 1) >> 1);
	}
	::std::array<bitvector, Bitlength> matrix;
	size_type size_;

	size_type at_least(size_type first, size_type last,
		const value_type value) const {
		assert(first <= size());
		assert(last <= size());
		assert(first <= last);
		size_type ret = 0;
		for (const auto &v : matrix) {
			const size_type l = v.rank(first), r = v.rank(last);
			if (value & v.bit) {
				first = l + v.cnt;
				last = r + v.cnt;
			}
			else {
				ret += r - l;
				first -= l;
				last -= r;
			}
		}
		return ret + last - first;
	}

public:
	constexpr wavelet_matrix() : matrix(), size_(0) {}
	template <class InputIter>
	wavelet_matrix(InputIter first, InputIter last) : matrix(), size_(0) {
		::std::vector<value_type> vec0(first, last);
		const size_type len = vec0.size();
		size_ = len;
		::std::vector<value_type> vec_l(len), vec_r(len);
		size_type l, r;
		value_type temp = static_cast<value_type>(1) << (Bitlength - 1);
		for (auto &v : matrix) {
			v = bitvector(len);
			v.bit = temp;
			temp = temp >> 1;
			l = 0;
			r = 0;
			for (size_type j = 0; j < len; ++j)
				if (vec0[j] & v.bit)
					vec_r[r++] = vec0[j], v.set(j);
				else
					vec_l[l++] = vec0[j];
			v.cnt = l;
			v.build();
			::std::swap(vec0, vec_l);
			::std::copy(vec_r.begin(), vec_r.begin() + r, vec0.begin() + l);
		}
	}

	size_type size() const noexcept { return size_; }
	bool empty() const noexcept { return size() == 0; }

	value_type operator[](size_type index) const {
		assert(index < size());
		value_type ret = 0;
		for (const auto &v : matrix)
			if (v.access(index))
				ret |= v.bit, index = v.rank(index) + v.cnt;
			else
				index -= v.rank(index);
		return ret;
	}
	value_type at(const size_type index) const {
		if (index < size())
			return operator[](index);
		else
			throw ::std::out_of_range("index out of range");
	}

	size_type rank(size_type first, size_type last,
		const value_type value) const {
		assert(first <= size());
		assert(last <= size());
		assert(first <= last);
		assert(valid(value));
		for (const auto &v : matrix)
			if (value & v.bit)
				first = v.rank(first) + v.cnt, last = v.rank(last) + v.cnt;
			else
				first -= v.rank(first), last -= v.rank(last);
		return last - first;
	}
	value_type quantile(size_type first, size_type last, size_type k = 0,
		const value_type upper = none) const {
		assert(first <= size());
		assert(last <= size());
		assert(valid(upper));
		if (upper != none)
			k += rangefreq(first, last, upper, none);
		if (last - first <= k)
			return none;
		value_type ret = 0;
		for (const auto &v : matrix) {
			const size_type l = v.rank(first), r = v.rank(last);
			if (r - l > k)
				first = l + v.cnt, last = r + v.cnt, ret |= v.bit;
			else
				first -= l, last -= r, k -= r - l;
		}
		return ret;
	}
	value_type rquantile(const size_type first, const size_type last,
		size_type k = 0, const value_type lower = none) const {
		assert(first <= size());
		assert(last <= size());
		assert(first <= last);
		assert(valid(lower));
		if (lower != none)
			k += rangefreq(first, last, none, lower);
		if (last - first <= k)
			return none;
		return quantile(first, last, last - first - k - 1, none);
	}
	size_type rangefreq(const size_type first, const size_type last,
		const value_type lower, const value_type upper) const {
		assert(first <= size());
		assert(last <= size());
		assert(first <= last);
		assert(valid(lower));
		assert(valid(upper));
		assert(lower == none || upper == none || lower <= upper);
		size_type ret = lower == none ? last - first : at_least(first, last, lower);
		return upper == none ? ret : ret - at_least(first, last, upper);
	}
};

#include<cstdio>
#include<vector>

int main() {
	using uint = unsigned int;
	uint n;
	scanf("%u", &n);
	std::vector<uint> a(n), b(n), c(n);
	for (auto& e : a)
		scanf("%u", &e);
	for (auto& e : b)
		scanf("%u", &e);
	uint ans = 0;
	if (n & 1) {
		for (const auto e : a)
			ans ^= e;
		for (const auto e : b)
			ans ^= e;
	}
	for (uint i = 1;i <= 28;++i) {
		const uint pbit = static_cast<uint>(1) << i;
		for (uint j = 0;j < n;++j)
			c[j] = b[j] & (pbit - 1);
		wavelet_matrix<uint, 28, 0> wm(c.cbegin(), c.cend());
		for (const auto e : a)
			if (e&&wm.rangefreq(0, n, pbit - (e&pbit - 1), 0) & 1)
				ans ^= pbit;
	}
	printf("%u\n", ans);
	return 0;
}


Measured memory_bytes: 6812