#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
#define int LL
#define double LD
typedef pair<int, int> PII;
const int N = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const int inf = 0x3f3f3f3f3f3f3f3f;
const double PI = acosl(-1.0);
const double eps = 1e-8;
const int MOD = 1e9 + 7;

void solve()
{
    cout << 20 << " " << 20 << endl;
    vector<string> s(21);
    s[1] = "00000000000000000000";
    s[2] = "11111111111111111110";
    s[3] = "10000000000000000010";
    s[4] = "10111111111111111010";
    s[5] = "10100000000000001010";
    s[6] = "10101111111111101010";
    s[7] = "10101000000000101010";
    s[8] = "10101011111110101010";
    s[9] = "10101010000010101010";
    s[10] = "10101010111010101010";
    s[11] = "10101010101010101010";
    s[12] = "10101010100010101010";
    s[13] = "10101010111110101010";
    s[14] = "10101010000000101010";
    s[15] = "10101011111111101010";
    s[16] = "10101000000000001010";
    s[17] = "10101111111111111010";
    s[18] = "10100000000000000010";
    s[19] = "10111111111111111110";
    s[20] = "10000000000000000000";
    for (int i = 1; i <= 20; i++) {
        for (int j = 0; j < 20; j++) {
            if (s[i][j] == '0') cout << '1';
            else
                cout << '0';
        }
        cout << endl;
    }
}
signed main()
{
    ios::sync_with_stdio(false), cin.tie(0);
    cout << fixed << setprecision(15);
    int _;
    // cin >> _;
    _ = 1;
    while (_--) {
        solve();
    }
    return 0;
}