#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 50;

int a[N], dp[N], f[N], g[N], lst[N];

int main()
{
	int n;
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	while (cin >> n)
	{
		for (int i = 1; i <= n; ++i) cin >> a[i];
		for (int i = 1; i <= n; ++i)
		{
			lst[i] = g[a[i]];
			g[a[i]] = i;
		}
		int tot = 0;
		memset(dp, 0x3f, n + 1 << 2);
		memset(f, 0, n + 1 << 2);
		memset(g, 0, n + 1 << 2);
		dp[0] = 0;
		for (int i = 1; i <= n; ++i)
		{
			int cnt = 0;
			g[++cnt] = i;
			for (int k = 1; k <= tot; ++k)
				if (a[f[k]] != a[i])
					g[++cnt] = f[k];
			for (int i = 1; i <= cnt; ++i) f[i] = g[i]; 
			tot = cnt;
			tot = std::min(tot, (int)sqrt(i) + 1);
			for (int k = 1; k <= tot; ++k)
				dp[i] = std::min(1ll * dp[i], dp[f[k + 1]] + 1ll * k * k);
		}
		printf("%d\n", dp[n]);
	}
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
	int T, n;
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	while ((cin >> n))
	{
		int sum = 0, x;
		while (n--) { cin >> x; sum ^= x; }
		puts(sum ? "Win" : "Lose");
	}
}

#include <bits/stdc++.h>

const int N = 1e5 + 50;
int a[N], b[N], n;
long long s, o, tot;

int main()
{
	while (~scanf("%d", &n))
	{
		s = 0;
		memset(b, -1, sizeof b);
		for (int i = 0; i <= n; ++i)
			scanf("%d", a + i);
		for (int i = n; i >= 0; --i)
			if (b[i] == -1)
			{
				tot = 1;
				while (tot <= i) tot <<= 1;
				tot--;
				o = tot ^ i;
				s += tot * 2;
				b[i] = o;
				b[o] = i;
			}
		printf("%lld\n", s);
		for (int i = 0; i <= n; ++i)
			printf(i == n ? "%d\n" : "%d ", b[a[i]]);
	}
	return 0;
}