#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;

typedef long long LL;
//#define int LL
#define inl inline
const int N = 3e5 + 10;
const int M = N * 2;
//const int mod=998244353;
const int mod = 1000000007;
const double eps = 1e-8;
//const int mod=1e9+7;
typedef pair<int, int> PII;
//const int INF=0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
int n, m;

void become_faster() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

void solve() {
    vector<string>s(21);
    s[1] ="11011011011000111000";
    s[2] ="01101101110001101100";
    s[3] ="00110110100011000100";
    s[4] ="10010101100110001110";
    s[5] ="11011100001100001000";
    s[6] ="01100111011000111010";
    s[7] ="00110001110000100110";
    s[8] ="01011000100000111100";
    s[9] ="01101101110011000010";
    s[10]="01011011011001110011";
    s[11]="01001110001101011011";
    s[12]="01111000000111001110";
    s[13]="00010000000011000000";
    s[14]="00010000000001101100";
    s[15]="11011000000010110110";
    s[16]="01101100000110011011";
    s[17]="00110110001101101101";
    s[18]="00011011011010110111";
    s[19]="00001101110011010100";
    s[20]="00000111011110011100";
    cout<<"20 20\n";
    for(int i=1;i<=20;i++)cout<<s[i]<<endl;
}

signed main() {
    become_faster();
    int T = 1;
    //T=read();
    //cin>>T;
    //for(int i=1;i<=100;i++)solve(i);
    while (T--) solve();
    return 0;
}
/*
11011011011000111000
01101101110001101100
00110110100011000100
10010101100110001110
11011100001100001000
01100111011000111010
00110001110000100110
01011000100000111100
01101101110011000010
01011011011001110011
01001110001101011011
01111000000111001110
00010000000011000000
00010000000001101100
11011000000010110110
01101100000110011011
00110110001101101101
00011011011010110111
00001101110011010100
00000111011110011100
 */