#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <unordered_set>
#include <math.h>
using namespace std;
 
typedef long long ll;
typedef pair<int, int> PII;
 
#define endl '\n'
#define fi first
#define se second
#define push_back
#define rep(i, l, r) for (ll i = l; i <= r; i ++ )

void solve()
{
    cout << 20 << ' ' << 20 << endl;
    
    string s[20] = {
        {"11011100011100011111"},
        {"10110100110100110101"},
        {"11101101101101101101"},
        {"10011011011011011010"},
        {"00110110110110110111"},
        {"01101101101101101101"},
        {"11011011011011011011"},
        {"10110110110110110110"},
        {"11101101101101101101"},
        {"10011011011011011001"},
        {"10110110110110110111"},
        {"01101101101101101101"},
        {"11011011011011011011"},
        {"10110110110110110110"},
        {"11101101101101101101"},
        {"10011011011011011001"},
        {"00110110110110110111"},
        {"11101101101101101101"},
        {"10011001011001011011"},
        {"11110111110111110110"}
    };
    
    for (int i = 0; i < 20; i ++ ) cout << s[i] << endl;
}
 
int main()
{
    cin.tie(nullptr) -> sync_with_stdio(false);
    
//     int _;
//     cin >> _;
//     while (_ -- )
        solve();

    return 0;
}