//#include <bits/stdc++.h>
#include <iostream>
#include <time.h>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <chrono>
#include <random>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <bitset>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <numeric>
#include <limits>
#include <cmath>
#include <thread>



/*#pragma GCC optimize("Ofast")

*/
#pragma GCC optimize("O3")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#define endl '\n'
#define X first
#define Y second
#define MAXN 32
#define MAXV 1048576
#define INF 1000010000
#define LLINF 1000000010000000000
#define ULLINF 10000000100000000000
#define MOD 1000000007
#define MAZNA 5030000
#define control cout<<" passed "<<'\n';


using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector <int> vi;
typedef vector <long long> vll;
typedef vector <unsigned long long> vull;
typedef vector <string> vs;
typedef pair <int,int> pii;
typedef pair <long long,long long> pll;
typedef pair <string,string> pss;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}


int rows[MAXN];
int cols[MAXN];
int n;
ll next_block(ll c,ll a,ll b)
{
    return ((c^a)+b);
}
ll next_rotation(ll f,ll d,ll e)
{
    return ((f^d)+e);
}
vector <pii> ans;
bool a[MAXN][MAXN];

pii shape[8][8][4];
void fill_shape()
{
    shape[0][0][0]={0,0};
    shape[0][0][1]={0,-1};
    shape[0][0][2]={-1,0};
    shape[0][0][3]={-1,-1};

    shape[0][1][0]={0,0};
    shape[0][1][1]={-1,0};
    shape[0][1][2]={-1,1};
    shape[0][1][3]={0,1};

    shape[0][2][0]={0,0};
    shape[0][2][1]={1,0};
    shape[0][2][2]={0,1};
    shape[0][2][3]={1,1};

    shape[0][3][0]={0,0};
    shape[0][3][1]={0,-1};
    shape[0][3][2]={1,-1};
    shape[0][3][3]={1,0};



    shape[1][0][0]={0,0};
    shape[1][0][1]={0,-1};
    shape[1][0][2]={-1,0};
    shape[1][0][3]={0,0};

    shape[1][1][0]={0,0};
    shape[1][1][1]={0,1};
    shape[1][1][2]={-1,0};
    shape[1][1][3]={0,0};

    shape[1][2][0]={0,0};
    shape[1][2][1]={1,0};
    shape[1][2][2]={0,1};
    shape[1][2][3]={0,0};

    shape[1][3][0]={0,0};
    shape[1][3][1]={0,-1};
    shape[1][3][2]={1,0};
    shape[1][3][3]={0,0};



    shape[2][0][0]={0,0};
    shape[2][0][1]={0,-1};
    shape[2][0][2]={0,-2};
    shape[2][0][3]={-1,0};

    shape[2][1][0]={0,0};
    shape[2][1][1]={-1,0};
    shape[2][1][2]={-2,0};
    shape[2][1][3]={0,1};

    shape[2][2][0]={0,0};
    shape[2][2][1]={1,0};
    shape[2][2][2]={0,1};
    shape[2][2][3]={0,2};

    shape[2][3][0]={0,0};
    shape[2][3][1]={1,0};
    shape[2][3][2]={2,0};
    shape[2][3][3]={0,-1};



    shape[3][0][0]={0,0};
    shape[3][0][1]={0,-1};
    shape[3][0][2]={0,-2};
    shape[3][0][3]={0,-3};

    shape[3][1][0]={0,0};
    shape[3][1][1]={-1,0};
    shape[3][1][2]={-2,0};
    shape[3][1][3]={-3,0};

    shape[3][2][0]={0,0};
    shape[3][2][1]={0,1};
    shape[3][2][2]={0,2};
    shape[3][2][3]={0,3};

    shape[3][3][0]={0,0};
    shape[3][3][1]={1,0};
    shape[3][3][2]={2,0};
    shape[3][3][3]={3,0};



    shape[4][0][0]={0,0};
    shape[4][0][1]={-1,0};
    shape[4][0][2]={-2,0};
    shape[4][0][3]={-1,-1};

    shape[4][1][0]={0,0};
    shape[4][1][1]={0,1};
    shape[4][1][2]={0,2};
    shape[4][1][3]={-1,1};

    shape[4][2][0]={0,0};
    shape[4][2][1]={1,0};
    shape[4][2][2]={2,0};
    shape[4][2][3]={1,1};

    shape[4][3][0]={0,0};
    shape[4][3][1]={0,-1};
    shape[4][3][2]={0,-2};
    shape[4][3][3]={1,-1};
}

bool is_valid(ll x,ll y,int block,int rotation)
{
    for(int i=0;i<=3;i++)
    {
        int r1,r2;

        r1=shape[block][rotation][i].X+x;
        r2=shape[block][rotation][i].Y+y;//cout<<"r1 = "<<r1<<" r2 = "<<r2<<" a[r1][r2] = "<<a[r1][r2]<<endl;
        if(r1<1||r1>n||r2<1||r2>n)return false;
        else if(a[r1][r2]==1)return false;
    }
    return true;
}



void fill_move(ll x,ll y,int block,int rotation)
{
    for(int i=0;i<=3;i++)
    {
        int r1,r2;
        r1=shape[block][rotation][i].X+x;
        r2=shape[block][rotation][i].Y+y;
        if(a[r1][r2]==0)
        {
            a[r1][r2]=1;
            rows[r1]++;
            cols[r2]++;
        }
    }
    return;
}
void unfill_move(ll x,ll y,int block,int rotation)
{
    for(int i=0;i<=3;i++)
    {
        int r1,r2;
        r1=shape[block][rotation][i].X+x;
        r2=shape[block][rotation][i].Y+y;
        if(a[r1][r2]==1)
        {
            a[r1][r2]=0;
            rows[r1]--;
            cols[r2]--;
        }
    }
    return;
}


bool lampa=0;
int br2=0;
void cleartable(int block,int rotation,int x,int y)
{
    bool used[MAXN][MAXN];
    /*for(int i=1;i<MAXN;i++)
    {
        for(int j=1;j<MAXN;j++)
        {
            used[i][j]=0;
        }
    }
    vector <int> row;
    row.clear();
    vector <int> col;
    col.clear();
    for(int i=0;i<=3;i++)
    {
        int r1,r2;
        r1=shape[block][rotation][i].X+x;
        r2=shape[block][rotation][i].Y+y;
        if(used[r1][r2])continue;
        used[r1][r2]=1;
        if(rows[r1]==n)row.push_back(r1);
        if(cols[r2]==n)col.push_back(r2);
    }
    for(int w:row)
    {
        rows[w]=0;
        for(int i=1;i<=n;i++)
        {
            a[w][i]=0;
            cols[i]--;
            //if(cols[i]<0)cols[i]=0;
        }
    }
    for(int w:col)
    {
        cols[w]=0;
        for(int i=1;i<=n;i++)
        {
            a[i][w]=0;
            rows[i]--;
            //if(rows[i]<0)rows[i]=0;
        }
    }
    /*or(int i=1;i<=n;i++)
    {
        if(rows[i]<0)rows[i]=0;
        if(cols[i]<0)cols[i]=0;
    }*/
    memset(used,0,sizeof(used));
    vector <int> row;
    vector <int> col;


    for(int i=1;i<=n;i++)
    {
        if(rows[i]>=n)
        {
            row.push_back(i);
            //for(int j=1;j<=n;j++)used[i][j]=1;
        }
        if(cols[i]>=n)
        {
            col.push_back(i);
            //for(int j=1;j<=n;j++)used[j][i]=1;
        }
    }
    /*control;
    cout<<col[0]<<flush<<endl;
    exit(0);*/
    for(int w:row)
    {
        for(int i=1;i<=n;i++)
        {
            if(a[w][i]==1)
            {
                cols[i]--;
                rows[w]--;
                a[w][i]=0;
            }
        }
    }
    for(auto w:col)
    {
        for(int i=1;i<=n;i++)
        {
            if(a[i][w]==1)
            {
                rows[i]--;
                cols[w]--;
                a[i][w]=0;
            }
        }
    }
    /*for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(used[i][j]&&a[i][j]==1)
            {
                a[i][j]=0;
                rows[i]--;
                cols[j]--;
                //br2++;
            }
        }
    }*/
}
int brrow=0;
int brcol=0;
void mazna(ll x,ll y,ll ar,ll b,ll c,ll d,ll e,ll f)
{
    int block=c%5;
    int rotation=f%4;
    c=next_block(c,ar,b);
    f=next_rotation(f,d,e);
    /*for(int i=1;i<=n;i++)
    {
        if(x==6&&y==4&&block==2&&rotation==2)
        {
            cout<<rows[i]<<" i = "<<i<<" "<<cols[i]<<flush<<endl;
        }
    }
    int b=0;*/
    brrow=0;
    brcol=0;
    for(int i=0;i<=3;i++)
    {
        int r1,r2;
        r1=shape[block][rotation][i].X+x;
        r2=shape[block][rotation][i].Y+y;
        if(!a[r1][r2])
        {
            a[r1][r2]=1;
            rows[r1]++;
            cols[r2]++;
            if(rows[r1]==n)brrow++;
            if(cols[r2]==n)brcol++;
        }

        /*if(rows[r1]>n)rows[r1]=n;
        if(cols[r2]>n)cols[r2]=n;*/
    }

    /*for(int i=1;i<=n;i++)
    {
        if(rows[i]==n)brrow++;
        if(cols[i]==n)brcol++;
    }*/

    br2+=brrow*n;
    br2=br2+(brcol*n)-brrow*brcol;

    for(int i=0;i<=3;i++)
    {
        int r1,r2;
        r1=shape[block][rotation][i].X+x;
        r2=shape[block][rotation][i].Y+y;
        if(a[r1][r2])
        {
            a[r1][r2]=0;
            rows[r1]--;
            cols[r2]--;

        }
        /*if(rows[r1]<0)rows[r1]=0;
        if(cols[r2]<0)cols[r2]=0;*/
    }
    return;
}

int used[MAXN][MAXN];



void fill_a()
{
    for(int i=0;i<MAXN;i++)
    {
        for(int j=0;j<MAXN;j++)
        {
            if(i<1||i>n||j<1||j>n)
            {
                a[i][j]=1;
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            a[i][j]=0;
        }
    }
}

///   <-------------------------------------------------------------->

bool nz[MAXN][MAXN];
ll onecnt(ll x,ll y,int block,int rotation)
{
    int br=0;
    for(int i=0;i<=3;i++)
    {
        int r1,r2;
        r1=shape[block][rotation][i].X+x;
        r2=shape[block][rotation][i].Y+y;

        if(a[r1-1][r2])
        {
            //nz[r1-1][r2]=1;
            br++;
        }


        if(a[r1][r2+1])
        {
            //nz[r1][r2+1]=1;
            br++;
        }
        if(a[r1][r2-1])
        {

            br++;
        }


        if(a[r1+1][r2])
        {

            br++;
        }



    }
    if(n>8)
    {
        if(block==1)
        {
            if(rotation==0)
            {
                if(a[x-1][y-1]/*||a[x+1][y]==1&&a[x+1][y-1]==1&&a[x][y+1]==1&&a[x-1][y+1]==1*/)br+=20;
                //else if(a[x+1][y+1]&&a[x+1][y]&&a[x][y+1])br+=10;
            }
            else if(rotation==1)
            {
                if(a[x-1][y+1]/*||a[x+1][y]==1&&a[x+1][y+1]==1&&a[x][y-1]==1&&a[x-1][y+1]==1*/)br+=20;
                //else if(a[x+1][y-1]==1&&a[x][y-1]==1&&a[x+1][y]==1)br+=10;
            }
            else if(rotation==2)
            {
                if(a[x+1][y+1]/*||a[x-1][y]==1&&a[x-1][y+1]==1&&a[x][y-1]==1&&a[x+1][y-1]==1*/)br+=20;
                //else if(a[x-1][y-1]==1&&a[x][y-1]==1&&a[x-1][y]==1)br+=10;
            }
            else
            {
                if(a[x+1][y-1]/*||a[x-1][y]==1&&a[x-1][y-1]==1&&a[x][y+1]==1&&a[x+1][y+1]==1*/)br+=20;
                //else if(a[x-1][y+1]==1&&a[x][y+1]==1&&a[x-1][y]==1)br+=10;
            }
        }
        else if(block==4)
        {
            if(rotation==0)
            {
                if(a[x][y-1]&&a[x-2][y-1])br+=20;
                //else if(a[x+1][y+1]==1&&a[x+1][y]==1&&a[x][y+1]==1)br+=10;
            }
            else if(rotation==1)
            {
                if(a[x-1][y]&&a[x-1][y+2])br+=20;
                //else if(a[x+1][y-1]==1&&a[x][y-1]==1&&a[x+1][y]==1)br+=10;
            }
            else if(rotation==2)
            {
                if(a[x][y+1]&&a[x+2][y+1])br+=20;
                //else if(a[x-1][y-1]==1&&a[x][y-1]==1&&a[x-1][y]==1)br+=10;
            }
            else
            {
                if(a[x+1][y]&&a[x+1][y-2])br+=20;
                //else if(a[x-1][y+1]==1&&a[x][y+1]==1&&a[x-1][y]==1)br+=10;
            }
        }
        return br;
    }
    /*if(block==0)
    {
        int brup,brdwn,brl,brr;
        brup=brdwn=brl=brr=0;
        for(int i=0;i<=3;i++)
        {
            int r1,r2;
            r1=shape[block][rotation][i].X+x;
            r2=shape[block][rotation][i].Y+y;

            if(a[r1-1][r2])
            {
                brup++;
            }


            if(a[r1][r2+1])
            {
                brr++;
            }
            if(a[r1][r2-1])
            {
                brl++;
            }


            if(a[r1+1][r2])
            {
                brdwn++;
            }
        }
        if(brdwn>=2)br+=10;
        if(brr>=2)br+=10;
        if(brdwn>=2)br+=10;
        if(brl>=2)br+=10;
    }*/
    if(block==2)
    {
        if(rotation==0)
        {
            if(a[x-1][y-1]==1&&a[x-1][y-2])br+=20;
            else if(a[x+1][y]&&a[x+1][y-1]&&a[x+1][y-2])br+=10;

        }
        else if(rotation==1)
        {
            if(a[x-1][y+1]==1&&a[x-2][y+1])br+=20;
            else if(a[x-1][y+1]&&a[x-2][y+1]&&a[x-1][y+1])br+=10;
            //else if(a[x+1][y-1]&&a[x][y-1]&&a[x+1][y])br+=10;
        }
        else if(rotation==2)
        {
            if(a[x+1][y+1]==1&&a[x+1][y+2])br+=20;
            if(a[x][y-1]&&a[x-1][y-1]&&a[x-2][y-1])br+=10;
            //else if(a[x-1][y-1]&&a[x][y-1]&&a[x-1][y])br+=10;
        }
        else
        {
            if(a[x+1][y-1]==1&&a[x+2][y-1])br+=20;
            else if(a[x][y+1]&&a[x+1][y+1]&&a[x+2][y+1])br+=10;
            //else if(a[x-1][y+1]&&a[x][y+1]&&a[x-1][y])br+=10;
        }
    }
    if(block==3)
    {
        if(rotation==0)
        {
            if(a[x-1][y-1]&&a[x-1][y-2]||a[x+1][y-1]&&a[x+1][y-2])br+=20;
            //if(a[x][y+1])br+=5;
            //if(a[x][y-4])br+=5;
            //else if(a[x+1][y+1]&&a[x+1][y]&&a[x][y+1])br+=10;
        }
        else if(rotation==1)
        {
            if(a[x-1][y+1]&&a[x-2][y+1]||a[x-1][y-1]&&a[x-2][y-1])br+=20;
            //if(a[x+1][y])br+=5;
            //if(a[x-4][y])br+=5;
            //else if(a[x+1][y-1]&&a[x][y-1]&&a[x+1][y])br+=10;
        }
        else if(rotation==2)
        {
            if(a[x+1][y+1]&&a[x+1][y+2]||a[x-1][y+1]&&a[x-1][y+2])br+=20;
            //if(a[x-1][y])br+=5;
            //if(a[x+4][y])br+=5;
            //else if(a[x-1][y-1]&&a[x][y-1]&&a[x-1][y])br+=10;
        }
        else
        {
            if(a[x+1][y-1]&&a[x+2][y-1]||a[x+1][y+1]&&a[x+2][y+1])br+=20;
            //if(a[x][y-1])br+=5;
            //if(a[x][y+4])br+=5;
            //else if(a[x-1][y+1]&&a[x][y+1]&&a[x-1][y])br+=10;
        }
    }
    else if(block==1)
    {
        if(rotation==0)
        {
            if(a[x-1][y-1]/*||a[x+1][y]==1&&a[x+1][y-1]==1&&a[x][y+1]==1&&a[x-1][y+1]==1*/)br+=20;
            //else if(a[x+1][y+1]&&a[x+1][y]&&a[x][y+1])br+=10;
        }
        else if(rotation==1)
        {
            if(a[x-1][y+1]/*||a[x+1][y]==1&&a[x+1][y+1]==1&&a[x][y-1]==1&&a[x-1][y+1]==1*/)br+=20;
            //else if(a[x+1][y-1]==1&&a[x][y-1]==1&&a[x+1][y]==1)br+=10;
        }
        else if(rotation==2)
        {
            if(a[x+1][y+1]/*||a[x-1][y]==1&&a[x-1][y+1]==1&&a[x][y-1]==1&&a[x+1][y-1]==1*/)br+=20;
            //else if(a[x-1][y-1]==1&&a[x][y-1]==1&&a[x-1][y]==1)br+=10;
        }
        else
        {
            if(a[x+1][y-1]/*||a[x-1][y]==1&&a[x-1][y-1]==1&&a[x][y+1]==1&&a[x+1][y+1]==1*/)br+=20;
            //else if(a[x-1][y+1]==1&&a[x][y+1]==1&&a[x-1][y]==1)br+=10;
        }
    }
    else if(block==4)
    {
        if(rotation==0)
        {
            if(a[x][y-1]&&a[x-2][y-1])br+=20;
            //else if(a[x+1][y+1]==1&&a[x+1][y]==1&&a[x][y+1]==1)br+=10;
        }
        else if(rotation==1)
        {
            if(a[x-1][y]&&a[x-1][y+2])br+=20;
            //else if(a[x+1][y-1]==1&&a[x][y-1]==1&&a[x+1][y]==1)br+=10;
        }
        else if(rotation==2)
        {
            if(a[x][y+1]&&a[x+2][y+1])br+=20;
            //else if(a[x-1][y-1]==1&&a[x][y-1]==1&&a[x-1][y]==1)br+=10;
        }
        else
        {
            if(a[x+1][y]&&a[x+1][y-2])br+=20;
            //else if(a[x-1][y+1]==1&&a[x][y+1]==1&&a[x-1][y]==1)br+=10;
        }
    }

    return br;
}

bool speciale_valid(ll x,ll y,ll ar,ll b,ll c,ll d,ll e,ll f)
{
    int i,j;
    i=x;
    j=y;
    if(!is_valid(i,j,c%5,f%5))return false;
    c=next_block(c,ar,b);
    f=next_rotation(f,d,e);
    ll cc=next_block(c,ar,b);
    ll cf=next_rotation(f,d,e);
    ll ccc=next_block(cc,ar,b);
    ll ccf=next_rotation(cf,d,e);
    fill_move(i,j,c%5,f%5);
    bool used1[MAXN][MAXN];
    bool used2[MAXN][MAXN];
    memset(used1,0,sizeof(used1));
    memset(used2,0,sizeof(used2));
    for(int i1=1;i1<=n;i1++)
    {
        for(int j1=1;j1<=n;j1++)
        {
            if(!is_valid(i1,j1,cc%5,cf%5))continue;
            fill_move(i1,j1,cc%5,cf%5);
            for(int i2=1;i2<=n;i2++)
            {
                for(int j2=1;j2<=n;j2++)
                {
                    if(is_valid(i2,j2,ccc%5,ccf%5)==1)
                    {
                        unfill_move(i1,j1,cc%5,cf%5);
                        unfill_move(i,j,c%5,f%5);
                        return true;
                    }
                }
            }
            //unfill_move(i1,j1,cc%5,cf%5);*/
        }
    }
    //unfill_move(i,j,c%5,f%5);
    return false;
}

void solve()
{

    fill_a();
    fill_shape();
    ll ar,b,c,d,e,f;
    cin>>n>>ar>>b>>c>>d>>e>>f;int start=clock();



    int br1=0;
    for(int i=1;i<=n;i++)
    {
        rows[i]=0;
        cols[i]=0;
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            a[i][j]=0;
        }
    }
    /*if(n<=8){

    while(1)
    {
        broi++;
        cleartable();
        c=next_block(c,ar,b);
        f=next_rotation(f,d,e);


        bool lamp=0;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                used[i][j]=speciale_valid(i,j,ar,b,c,d,e,f);
                //cout<<used[i][j]<<" ";
                if(used[i][j])lamp=1;
            }//cout<<endl;
        }
        if(lamp==0)break;

        /*for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                cout<<used[i][j]<<" ";
            }
            cout<<endl;
        }cout<<endl;

        int ma=-1;
        pii p={1,1};
        int br4=0;
        int mar=-1;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                //cout<<used[i][j]<<" ";
                if(used[i][j]!=1)continue;
                int br=onecnt(i,j,c%5,f%4);
                if(br==0||br<mar/8)continue;
                br2=0;
                mazna(i,j,ar,b,c,d,e,f,broi);

                int br3=0;
                if(c%5==1)
                {
                    br3=3;
                    br1+=3;
                }
                else
                {
                    br1+=4;
                    br3=4;
                }
                br3+=br1;

                br3-=br2;

                int r=br1-br3;

                if(r>mar)
                {
                    //
                    br4=br3;
                    mar=r;
                    p={i,j};
                }
                else if(br>ma&&mar==-1)
                {

                    ma=br;
                    p={i,j};
                }
                if(c%5==1)
                {
                    br3=3;
                }
                else
                {
                    br1-=4;
                }
            }
        }
        /*for(int i=1;i<=n;i++)
        {
            /*if(rows[i]==n)brrow++;
            if(cols[i]==n)brcol++;
            if(broi)
            {
                cout<<rows[i]<<" i = "<<i<<" "<<cols[i]<<endl;
            }
        }
        /*if(maznaaa==1){ fill_move(p.X,p.Y,c%5,f%4);
        ans.push_back(p);//}

        if(mar==-1)
        {
            if(c%5==1)br1+=3;
            else br1+=4;
        }
        else br1=br4;

        if(clock()-start>=MAZNA)break;
        /**for(int i=0;i<=n+1;i++)
        {
            for(int j=0;j<=n+1;j++)
            {
                cout<<a[i][j]<<" ";
            }
            cout<<endl;
        }cout<<endl;//
        if(broi==20)break;
    }}*/
    while(1)
    {
        //broi++;
        c=next_block(c,ar,b);
        f=next_rotation(f,d,e);
        vector <pair<int,int>> nuli;

        bool lamp=0;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                used[i][j]=is_valid(i,j,c%5,f%4);
                //cout<<used[i][j]<<" ";
                if(used[i][j])
                {
                    lamp=1;
                }
            }//cout<<endl;
        }
        if(!lamp)break;
        brrow=0;
        brcol=0;
        /*for(int i=1;i<=n;i++)
        {
            if(rows[i]==n-1)control;
            if(rows[i]==n)brrow++;
            if(cols[i]==n)brcol++;
        }
        cout<<brrow<<" ; "<<brcol<<endl;*/
        int ma=-1;
        pii p={1,1};
        int br4=0;
        int mar=-1;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                //cout<<used[i][j]<<" ";
                if(!used[i][j])continue;
                int br=onecnt(i,j,c%5,f%4);
                if(br==0||br<mar/8)continue;
                br2=0;
                mazna(i,j,ar,b,c,d,e,f);

                int br3=0;
                if(c%5==1)
                {
                    br3=3;
                    br1+=3;
                }
                else
                {
                    br1+=4;
                    br3=4;
                }
                br3+=br1;

                br3-=br2;

                int r=br1-br3;

                if(r>mar)
                {
                    //
                    br4=br3;
                    mar=r;
                    p={i,j};
                }
                else if(br>ma&&mar==-1)
                {

                    ma=br;
                    p={i,j};
                }
                if(c%5==1)
                {
                    br3=3;
                }
                else
                {
                    br1-=4;
                }
            }        }


        /*for(int i=1;i<=n;i++)
        {
            /*if(rows[i]==n)brrow++;
            if(cols[i]==n)brcol++;
            if(broi)
            {
                cout<<rows[i]<<" i = "<<i<<" "<<cols[i]<<endl;
            }
        }*/
        /*if(maznaaa==1){ */
        fill_move(p.X,p.Y,c%5,f%4);
        ans.push_back(p);

        if(mar==-1)
        {
            if(c%5==1)br1+=3;
            else br1+=4;
        }
        else br1=br4;
        if(clock()-start>=MAZNA)break;
        /**for(int i=0;i<=n+1;i++)
        {
            for(int j=0;j<=n+1;j++)
            {
                cout<<a[i][j]<<" ";
            }
            cout<<endl;
        }cout<<rows[5]<<endl<<endl;//*/

        if(mar!=-1)cleartable(c%5,f%4,p.X,p.Y);
    }

    /**for(int i=0;i<=n+1;i++)
    {
        for(int j=0;j<=n+1;j++)
        {
            cout<<a[i][j]<<" ";
        }
        cout<<endl;
    }cout<<endl;//*/
    cout<<ans.size()<<endl;
    for(auto w:ans)
    {
        cout<<w.X<<" "<<w.Y<<endl;
    }
}

int main()
{
    #ifdef ONLINE_JUDGE
    freopen("block.in", "r", stdin);
    freopen("block.out", "w", stdout);
    #endif
    speed();
    solve();
    return 0;
}