#include <bits/stdc++.h>    

using namespace std;

typedef long long ll;

const int N = (int)2e5 + 12, MOD = (int)1e9 + 7, b = 19;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, p[N];

int get(int v) {
    if(p[v] == v) return v;
    return p[v] = get(p[v]);
}
void test() {
    n = 9;
    cout << n << '\n';
    for(int i = 1; i <= n; i++) {
        p[i] = i;
        int f = rng()%3;
        if(f > 0) f = 0;
        else f = 1;
        if(i == 5) {
            f = 1;
        }
        cout << f;
    }
    cout << '\n';
    for(int i = 1; i <= n - 1; i++) {
        int k = rng() % n + 1;
        cout << k << ' ';
        vector<int> f;
        for(int j = 1; j <= n; j++) {
            if(get(j) != get(k)) {
                f.push_back(j);
            }
        }
        int r = rng()%((int)f.size());
        p[get(f[r])] = get(k);
        cout << f[r] << '\n';
    }
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;
    // cin >> t;
    
    while(t--)
        test();
}