1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000'000'000'000'000'000LL;
const int II = 2'000'000'000;
const ll M = 1000'000'007LL;
const int N = 1000'007;
int tab[N];
string s[4];


void Gen(int n)
{
    string a(n, '0'), b(n, '1');
    a[n - 1] = '1';
    b[0] = '0';
    s[0] = a;
    s[1] = b;
}

void Solve()
{
    int n = 100;
    Gen(n);
    cout << "1";
    for(int i = 2; i <= n; ++i)
        cout << "0";
    cout << "\n";
    cout << "0";
    for(int i = 2; i <= n; ++i)
        cout << "1";
    cout << "\n";
    for(int i = 1; i <= (n / 2) - 1; ++i)
    {
        cout << s[0] << "\n";
        cout << s[1] << "\n";
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //int t; cin >> t;
    //while(t--)
        Solve();

    return 0;
}