#include<bits/stdc++.h>
#define ll long long

using namespace std;

const int N = 2e3 + 10, mod = 1e9 + 7;

int c[30][30], n = 20, m = 20;
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

void solve()
{
    int st = 1, x = 1, y = 1, cnt = 0;c[x][y] = 1;
    while (cnt < 10)
    {
        x = x + dx[st], y = y + dy[st];

        if (x > n || y > m || x == 0 || y == 0 || c[x + dx[st]][y + dy[st]] || c[x][y]) {
            x -= dx[st], y -= dy[st];
            //cout << x << ' ' << y << endl;
            st = (st + 1) % 4, cnt++;
            continue;
        }
        c[x][y] = 1, cnt = 0;
    }
    c[x][y] = 0;
    cout << 20 << ' ' << 20 << endl;
    for (int i = 1; i <= 20; i++)
    {
        for (int j = 1; j <= 20; j++)cout << c[i][j];
        cout << endl;
    }
}

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    while (t--)solve();
    return 0;
}