/* name: 5053
 * author: 5ab
 * created at: 2024-04-05
 */
#include <bits/stdc++.h>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define ssz(x) (int((x).size()))

auto chmax = [](auto& x, auto y) { if (x < y) x = y; };
auto chmin = [](auto& x, auto y) { if (y < x) x = y; };

using ll = long long;
using u64 = unsigned long long;
const int N = 1e5, LN = 50, B = 64, X[] = { 13, -7, 17 };

int a[N], p[N], rs[N], n;
bitset<B + 1> s[B];
bitset<B + 1> ans;
u64 cb[B];

bool dfs(int cx)
{
	if (cx == -1)
	{
		u64 x = 0;
		for (int i = 0; i < B; i++)
			x |= u64(s[i].test(B)) << i;
		for (int i = 0; i < n; i++)
		{
			for (int y : X)
				if (y > 0)
					x ^= x << y;
				else
					x ^= x >> (-y);
			if (x % (i + 1) != rs[i])
				return 0;
		}
		return 1;
	}
	auto cp = s[cx];
	if (s[cx].none())
	{
		s[cx].set(cx);
		if (dfs(cx - 1)) return 1;
		s[cx].set(B), ans.set(cx);
		if (dfs(cx - 1)) return 1;
	}
	else
	{
		int res = ((s[cx] & ans).count() & 1) ^ s[cx].test(B);
		s[cx].reset();
		s[cx].set(cx);
		s[cx].set(B, res), ans.set(cx, res);
		if (dfs(cx - 1)) return 1;
	}
	ans.reset(cx);
	s[cx] = cp;
	return 0;
}

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> a[i], a[i]--;
		p[a[i]] = i;
	}
	for (int i = n - 1; i >= 0; i--)
	{
		rs[i] = p[i];
		p[a[i]] = p[i];
		a[p[i]] = a[i];
	}
	
	for (int i = 0; i < B; i++)
		cb[i] = 1ull << i;
	int rk = 0;
	for (int i = 0; i < n; i++)
	{
		for (int x : X)
			if (x > 0)
			{
				for (int j = B - 1; j >= x; j--)
					cb[j] ^= cb[j - x];
			}
			else
			{
				x *= -1;
				for (int j = x; j < B; j++)
					cb[j - x] ^= cb[j];
			}
		for (int x = i + 1, ts = rs[i], j = 0; x % 2 == 0; x /= 2, ts /= 2, j++)
		{
			bitset<B + 1> cl;
			for (int k = 0; k < B; k++)
				cl.set(k, (cb[j] >> k) & 1);
			cl.set(B, ts % 2);
			// cerr << cl << " ";
			
			bool ok = 0;
			for (int k = 0; k < B; k++)
				if (cl.test(k))
				{
					if (s[k].none())
					{
						s[k] = cl, ok = 1, rk++;
						break;
					}
					cl ^= s[k];
				}
			// cerr << cl << endl;
			assert(ok || cl.none());
		}
		if (rk == B)
			break;
	}
	
	assert(dfs(B - 1));
	u64 x = 0;
	for (int i = 0; i < B; i++)
		x |= u64(s[i].test(B)) << i;
	cout << x << endl;
	
	return 0;
}
// started coding at: 04-05 08:59:05
/*
50
36 22 24 21 27 50 28 14 25 34 18 43 47 13 30 7 10 48 20 16 29 9 8 15 3 31 12 38 19 49 37 1 46 32 4 44 11 35 6 33 26 5 45 17 39 40 2 23 42 41
*/