#include<bits/stdc++.h>
using namespace std;
const int N=25;
int n,a[N][N];
void solve(int l,int r,bool fl){
	if(l>r){
		return;
	}
	for(int i=l;i<=r;i++){
		a[l][i]=1;
		a[r][i]=1;
		a[i][l]=1;
		a[i][r]=1;
	}
	if(fl){
		a[l+2][l+1]=1;
		a[r][r-1]=0;
	}else{
		a[r-2][r-1]=1;
		a[l+1][l]=0;
	}
	solve(l+2,r-2,!fl);
}
int main(){
	cin.tie(0)->sync_with_stdio(0);
	n=20;
	solve(1,n,true);
	cout<<n<<" "<<n<<endl;
	a[11][10]=0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++)cout<<a[i][j];
		// for(int j=1;j<=n;j++)cout<<(a[i][j]?'X':' ');
		cout<<endl;
	}
}