#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
int n;
int a[2000010],b[2000010];
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;++i)
		scanf("%d",a+i);
	if(n==1)
	{
		printf("%d",!a[1]);
		return 0;
	}
	if(n%2) b[n/2+1]=!a[n/2+1];
	else b[n/2]=a[n/2];
	for(int i=1,t=1;i<=n/2;++i,t+=2)
		b[i]=a[n-t+1];
	int s=n/2+n%2;
	for(int i=n,t=2;i>s;--i,t+=2)
		b[i]=a[n-t+1];
	for(int i=1,t=1;i<=n/2;++i,t+=2)
	{
		if(((n-t+1)%2)&&(n%2))
			b[i]=!b[i];
		else if(!((n-t+1)%2)&&!(n%2))
			b[i]=!b[i];
	}
	for(int i=n,t=2;i>s;--i,t+=2)
	{
		if(((n-t+1)%2)&&(n%2))
			b[i]=!b[i];
		else if(!((n-t+1)%2)&&!(n%2))
			b[i]=!b[i];
	}
	for(int i=1;i<=n;++i)
		printf("%d ",b[i]);
	return 0;
}
/*
1 2 3 4
2 1 3 4
3 1 2 4
4 2 1 3
1 2 3 4 5
2 1 3 4 5
3 1 2 4 5
4 2 1 3 5
5 3 1 2 4
*/

rt，测试点5过不了