#include<bits/stdc++.h>
using namespace std;


int n;
long long xor1, xor2;
long long curr1, curr2;
long long sub1, sub2;

vector<pair<int, int>>puz[5][4];


void fastIO()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void input()
{
    cin>>n;
    cin>>xor1>>sub1>>curr1;
    cin>>xor2>>sub2>>curr2;
}

void view()
{
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=n; j++)
        {

        }
        cout<<endl;
    }
    cout<<endl;
    return;
}

void zapul()
{
    puz[0][0].push_back({0, 0});
    puz[0][0].push_back({-1, 0});
    puz[0][0].push_back({0, -1});
    puz[0][0].push_back({-1, -1});

    puz[0][1].push_back({0, 0});
    puz[0][1].push_back({-1, 0});
    puz[0][1].push_back({0, 1});
    puz[0][1].push_back({-1, 1});

    puz[0][2].push_back({0, 0});
    puz[0][2].push_back({1, 0});
    puz[0][2].push_back({0, 1});
    puz[0][2].push_back({1, 1});

    puz[0][3].push_back({0, 0});
    puz[0][3].push_back({1, 0});
    puz[0][3].push_back({1, -1});
    puz[0][3].push_back({0, -1});




    puz[1][0].push_back({0, 0});
    puz[1][0].push_back({0, -1});
    puz[1][0].push_back({-1, 0});

    puz[1][1].push_back({0, 0});
    puz[1][1].push_back({-1, 0});
    puz[1][1].push_back({0, 1});

    puz[1][2].push_back({0, 0});
    puz[1][2].push_back({0, 1});
    puz[1][2].push_back({1, 0});

    puz[1][3].push_back({0, 0});
    puz[1][3].push_back({1, 0});
    puz[1][3].push_back({0, -1});




    puz[2][0].push_back({0, 0});
    puz[2][0].push_back({-1, 0});
    puz[2][0].push_back({0, -1});
    puz[2][0].push_back({0, -2});

    puz[2][1].push_back({0, 0});
    puz[2][1].push_back({-1, 0});
    puz[2][1].push_back({-2, 0});
    puz[2][1].push_back({0, 1});

    puz[2][2].push_back({0, 0});
    puz[2][2].push_back({0, 1});
    puz[2][2].push_back({0, 2});
    puz[2][2].push_back({1, 0});

    puz[2][3].push_back({0, 0});
    puz[2][3].push_back({0, -1});
    puz[2][3].push_back({1, 0});
    puz[2][3].push_back({2, 0});




    puz[3][0].push_back({0, 0});
    puz[3][0].push_back({0, -1});
    puz[3][0].push_back({0, -2});
    puz[3][0].push_back({0, -3});

    puz[3][1].push_back({0, 0});
    puz[3][1].push_back({-1, 0});
    puz[3][1].push_back({-2, 0});
    puz[3][1].push_back({-3, 0});

    puz[3][2].push_back({0, 0});
    puz[3][2].push_back({0, 1});
    puz[3][2].push_back({0, 2});
    puz[3][2].push_back({0, 3});

    puz[3][3].push_back({0, 0});
    puz[3][3].push_back({1, 0});
    puz[3][3].push_back({2, 0});
    puz[3][3].push_back({3, 0});




    puz[4][0].push_back({0, 0});
    puz[4][0].push_back({-1, 0});
    puz[4][0].push_back({-1, -1});
    puz[4][0].push_back({-2, 0});

    puz[4][1].push_back({0, 0});
    puz[4][1].push_back({0, 1});
    puz[4][1].push_back({-1, 1});
    puz[4][1].push_back({0, 2});

    puz[4][2].push_back({0, 0});
    puz[4][2].push_back({1, 0});
    puz[4][2].push_back({1, 1});
    puz[4][2].push_back({2, 0});

    puz[4][3].push_back({0, 0});
    puz[4][3].push_back({0, -1});
    puz[4][3].push_back({1, -1});
    puz[4][3].push_back({0, -2});

    return;
}





vector<pair<int, int>>curr;



void rec(bool tab[30][30], long long x1, long long x2)
{
    if (curr.size()>=240000)
    {
        cout<<curr.size()<<'\n';
        for (int i=0; i<curr.size(); i++)
        {
            cout<<curr[i].first<<" "<<curr[i].second<<'\n';
        }
        exit(0);
    }
    /*
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=n; j++)
        {
            cout<<tab[i][j]<<" ";
        }
        cout<<endl;
    }
    */

    int c1=x1%5;
    int c2=x2%4;
    //cout<<c1<<" "<<c2<<endl;
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=n; j++)
        {
            bool lamp=true;
            for (int z=0; z<puz[c1][c2].size(); z++)
            {
                int x=i+puz[c1][c2][z].first;
                int y=j+puz[c1][c2][z].second;

                if (x>n || y>n || x<=0 || y<=0)
                {
                    lamp=false;
                    break;
                }

                if (tab[x][y])
                {
                    lamp=false;
                    break;
                }
            }

            if (lamp)
            {
                for (int z=0; z<puz[c1][c2].size(); z++)
                {
                    int x=i+puz[c1][c2][z].first;
                    int y=j+puz[c1][c2][z].second;

                    tab[x][y]=true;
                }

                bool cop[30][30]={};
                for (int x=1; x<=n; x++)
                {
                    for (int y=1; y<=n; y++)
                    {
                        cop[x][y]=tab[x][y];
                    }
                }

                vector<int>redove;
                for (int i=1; i<=n; i++)
                {
                    bool lamp=true;
                    for (int j=1; j<=n; j++)
                    {
                        lamp=min(lamp, cop[i][j]);
                    }
                    if (lamp)
                    {
                        redove.push_back(i);
                    }
                }

                for (int j=1; j<=n; j++)
                {
                    bool lamp=true;
                    for (int i=1; i<=n; i++)
                    {
                        lamp=min(lamp, cop[i][j]);
                    }
                    if (lamp)
                    {
                        for (int i=1; i<=n; i++)
                        {
                            cop[i][j]=false;
                        }
                    }
                }

                for (int i=0; i<redove.size(); i++)
                {
                    for (int j=1; j<=n; j++)
                    {
                        cop[redove[i]][j]=false;
                    }
                }


                curr.push_back({i, j});

                rec(cop, ((x1^xor1))+sub1, ((x2^xor2))+sub2);
                curr.pop_back();
                for (int z=0; z<puz[c1][c2].size(); z++)
                {
                    int x=i+puz[c1][c2][z].first;
                    int y=j+puz[c1][c2][z].second;

                    tab[x][y]=false;
                }
            }
        }
    }
}



int main ()
{
    freopen("block.in", "r", stdin);
    freopen("block.out", "w", stdout);

    fastIO();
    input();
    zapul();
    bool nach[30][30]={};
    rec(nach, ((curr1^xor1))+sub1, ((curr2^xor2))+sub2);


    return 0;
}