#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int a[10110][10110];
void c(int x,int y,int n)
{
	if(n==0)
	a[x][y]==1;
	else 
	{
		c(x,y+(1<<(n-1)),n-1);
		c(x+(1<<(n-1)),y,n-1);
		c(x+(1<<(n-1)),y+(1<<(n-1)),n-2);
	}
	return ;
}
int n;
int main()
{
	
	scanf("%d",&n);
	c(0,0,n);
	for(int i=0;i<(1<<n);i++)
	{
		for(int j=0;j<(1<<n);j++)
		cout<<a[i][j]<<" ";
		cout<<endl;
	}
	return 0;
}#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int a[10110][10110];
void c(int x,int y,int n)
{
	if(n==0)
	a[x][y]==1;
	else 
	{
		c(x,y+(1<<(n-1)),n-1);
		c(x+(1<<(n-1)),y,n-1);
		c(x+(1<<(n-1)),y+(1<<(n-1)),n-2);
	}
	return ;
}
int n;
int main()
{
	
	scanf("%d",&n);
	c(0,0,n);
	for(int i=0;i<(1<<n);i++)
	{
		for(int j=0;j<(1<<n);j++)
		cout<<a[i][j]<<" ";
		cout<<endl;
	}
	return 0;
}