#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

const int N = 105, T = 17, K = 6;
const LL R = 1e17;

char buf[N];
struct BigInt{
    LL a[N];
    inline BigInt()
    {
        memset(a, 0, sizeof a);
    }
    inline void Read()
    {
        scanf("%s", buf);
        int n = strlen(buf);
        LL s = 1;
        for(int i = n - 1, j = 0, k = 0; i >= 0; i -- )
        {
            a[k] += s * (buf[i] ^ 48);
            j ++ , s *= 10;
            if(j == T) j = 0, s = 1, k ++ ;
        }
    }
    inline void Write()
    {
        int j = 0;
        for(int i = 0; i < K; i ++ )
        {
            LL t = a[i];
            for(int k = 0; k < T; k ++ ) buf[j ++ ] = (t % 10) ^ 48, t /= 10;
        }
        while(j > 1 && buf[j - 1] == '0') j -- ;
        reverse(buf, buf + j), buf[j] = 0;
        puts(buf);
    }
    inline bool Comp(const BigInt &x)
    {
        for(int i = K - 1; i >= 0; i -- )
            if(a[i] != x.a[i])
                return a[i] < x.a[i];
        return 1;
    }
    inline void Add(const BigInt &x, const BigInt &y)
    {
        LL t = 0;
        for(int i = 0; i < K; i ++ )
        {
            t += x.a[i] + y.a[i];
            a[i] = t % R, t /= R;
        }
    }
    inline void Del(const BigInt &x)
    {
        LL t = 0;
        for(int i = 0; i < K; i ++ )
        {
            t += a[i] - x.a[i];
            a[i] = t < 0 ? R + t : t;
            t = t < 0 ? -1 : 0;
        }
    }
};

int n, q;
char res[966];
BigInt f[488], g;

int main()
{
    // freopen("data", "w", stdout);
    n = 960;
    f[1].a[0] = f[2].a[0] = 1;
    for(int i = 3; i <= 480; i ++ ) f[i].Add(f[i - 2], f[i - 1]);
    printf("%d\n", n);
    for(int i = 1; i <= 240; i ++ )
    {
        printf("%d %d\n", i, i);
        printf("%d %d\n", i + 1, i);
        printf("%d %d\n", i, i + 1);
        printf("%d %d\n", i, i + 2);
    }
    scanf("%d", &q);
    while(q -- )
    {
        g.Read();
        for(int i = 1; i <= 960; i ++ ) res[i] = '0';
        for(int i = 480; i >= 1; i -- )
            if(f[i].Comp(g))
            {
                res[i * 2] = '1';
                g.Del(f[i]);
            }
        puts(res + 1);
    }
    return 0;
}