#include <iostream>
#include <fstream>
#include<vector>
#include<set>
#include<bitset>
using namespace std;
fstream cinn, coutt;
long a, b, C, d, e, F;
set<long> var;
int n, br = 0, maks = 0;
bool fal[25][25];
int kol[25], red[25];
vector<pair<int, int>> fig, ans;
void pripromqnakol(bool m[25][25])
{
	fill_n(red, n, 0);
	for (int x = 0; x < n; x++)//kol
	{
		kol[x] = 0;
		for (int y = 0; y < n; y++)
		{
			if (m[x][y]) {
				kol[x]++;
				red[y]++;
			}
		}
	}
}
short temp = 2;
void rec(bool m[25][25], long f, long c)
{
	c = (c ^ a) + b;
	f = (f ^ d) + e;
	cout << c << " " << f << endl;
	if (n < 20 && br > 70) { return; }
	else if (n > 16 && br > 100) return;
	if (n==25 && br <=90) { if (maks < br) { maks = br; ans = fig; } }
	else if (n ==20 && br <= 45) { if (maks < br) { maks = br; ans = fig; } }
	else if (n == 16 && br <= 30) { if (maks < br) { maks = br; ans = fig; } }
	else if (n == 8 && br <= 9) { if (maks < br) { maks = br; ans = fig; } }
	//else if (maks < br) { maks = br; ans = fig; }
	long mask = 0, step = 1;
	if (n == 8)
	{
		for (int i = 0; i < n; i++)
		{
			mask += step * red[i];
			if ((i%5)%2== 0)step = step + 1;
			/*for (int ii = 0; ii < n; ii++)
			{
				cout << m[ii][i];
			}
			cout << endl;*/
		}
	}
	else
	for (int i = 0; i < n; i++)
	{
		mask += step * red[i];
		if ((i % 7) % 2 == 0)step = step + 1;
		/*for (int ii = 0; ii < n; ii++)
		{
			cout << m[ii][i];
		}
		cout << endl;*/
	}
	//cout << red[0] << red[1] << red[2] << red[3] << red[4] << red[5] << red[6] << red[7]<<red[8]<<red[9] << endl << endl;

	if (var.find(mask) != var.end())
	{
		return;
	}
	else var.insert(mask);

	if (c % 5 == 0)
	{
		if (f % 4 == 0)
		{
			bool stavali = false;
			for (int x = 1; x < n; x = x+ temp)
			{
				for (int y = 1; y < n; y =y+temp)
				{
					if (!m[x][y] && !m[x - 1][y] && !m[x][y - 1] && !m[x - 1][y - 1])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25];
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								o[i][ii] = m[i][ii];
							}
						}
						kol[x] += 2; kol[x - 1] += 2; red[y] += 2; red[y - 1] += 2;
						m[x][y] = true; m[x - 1][y] = true; m[x - 1][y - 1] = true; m[x][y - 1] = true;

						if (kol[x] == n)
						{
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (kol[x - 1] == n)
						{
							for (int i = 0; i < n; i++) m[x - 1][i] = false;
						}
						if (red[y] == n)
						{
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						if (red[y - 1] == n)
						{
							for (int i = 0; i < n; i++) m[i][y - 1] = false;
						}
						pripromqnakol(m);
						br++;
						fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);

						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}
						fig.pop_back();
						br--;


					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; }  return; }
		}
		else if (f % 4 == 1)
		{
			bool stavali = false;
			for (int x = 0; x < n - 1; x =x+temp)
			{
				for (int y = 1; y < n; y = y +temp)
				{
					if (!m[x][y] && !m[x + 1][y] && !m[x][y - 1] && !m[x + 1][y - 1])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25];
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								o[i][ii] = m[i][ii];
							}
						}
						kol[x] += 2; kol[x + 1] += 2; red[y] += 2; red[y - 1] += 2;
						m[x][y] = true; m[x + 1][y] = true; m[x + 1][y - 1] = true; m[x][y - 1] = true;

						if (kol[x] == n)
						{
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (kol[x + 1] == n)
						{
							for (int i = 0; i < n; i++) m[x + 1][i] = false;
						}
						if (red[y] == n)
						{
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						if (red[y - 1] == n)
						{
							for (int i = 0; i < n; i++) m[i][y - 1] = false;
						}
						pripromqnakol(m);
						br++;
						fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);
						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}fig.pop_back();
						br--;

					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; }  return; }
		}
		else if (f % 4 == 2)
		{
			bool stavali = false;
			for (int x = 0; x < n - 1; x =x+temp)
			{
				for (int y = 0; y < n - 1; y = y +temp)
				{
					if (!m[x][y] && !m[x + 1][y] && !m[x][y + 1] && !m[x + 1][y + 1])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25];
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = m[i][ii];
							}
						}
						kol[x] += 2; kol[x + 1] += 2; red[y] += 2; red[y + 1] += 2;
						m[x][y] = true; m[x + 1][y] = true; m[x + 1][y + 1] = true; m[x][y + 1] = true;
						bool kolona = false, redd = false, redd1 = false, kol1 = false;
						if (kol[x] == n)
						{
							kolona = true;
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (kol[x + 1] == n)
						{
							kol1 = true;
							for (int i = 0; i < n; i++) m[x + 1][i] = false;
						}
						if (red[y] == n)
						{
							redd = true;
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						if (red[y + 1] == n)
						{
							redd1 = true;
							for (int i = 0; i < n; i++) m[i][y + 1] = false;
						}
						br++; pripromqnakol(m);
						fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);
						fig.pop_back();
						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}br--;

					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; } return; }
		}
		else
		{
			bool stavali = false;
			for (int x = 1; x < n; x =x+temp)
			{
				for (int y = 0; y < n - 1; y = y+ temp)
				{
					if (!m[x][y] && !m[x - 1][y] && !m[x][y + 1] && !m[x - 1][y + 1])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25];
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								o[i][ii] = m[i][ii];
							}
						}
						kol[x] += 2; kol[x - 1] += 2; red[y] += 2; red[y + 1] += 2;
						m[x][y] = true; m[x - 1][y] = true; m[x - 1][y + 1] = true; m[x][y + 1] = true;
						bool kolona = false, redd = false, redd1 = false, kol1 = false;
						if (kol[x] == n)
						{
							kolona = true;
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (kol[x - 1] == n)
						{
							kol1 = true;
							for (int i = 0; i < n; i++) m[x - 1][i] = false;
						}
						if (red[y] == n)
						{
							redd = true;
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						if (red[y + 1] == n)
						{
							redd1 = true;
							for (int i = 0; i < n; i++) m[i][y + 1] = false;
						}
						br++; pripromqnakol(m);
						fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);
						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}fig.pop_back();
						br--;

					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; } return; }
		}
	}
	else if (c % 5 == 1)
	{
		if (f % 4 == 0)
		{
			bool stavali = false;
			for (int x = 1; x < n; x =x+temp)
			{
				for (int y = 1; y < n; y = y+ temp)
				{
					if (!m[x][y] && !m[x - 1][y] && !m[x][y - 1])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25];
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								o[i][ii] = m[i][ii];
							}
						}
						kol[x] += 2; kol[x - 1] ++; red[y] += 2; red[y - 1] ++;
						m[x][y] = true; m[x - 1][y] = true;  m[x][y - 1] = true;
						bool kolona = false, redd = false, redd1 = false, kol1 = false;
						if (kol[x] == n)
						{
							kolona = true;
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (kol[x - 1] == n)
						{
							kol1 = true;
							for (int i = 0; i < n; i++) m[x - 1][i] = false;
						}
						if (red[y] == n)
						{
							redd = true;
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						if (red[y - 1] == n)
						{
							redd1 = true;
							for (int i = 0; i < n; i++) m[i][y - 1] = false;
						}
						br++; pripromqnakol(m);
						fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);
						if (kolona)
						{
							for (int i = 0; i < n; i++) m[x][i] = true;
						}if (redd)
						{
							for (int i = 0; i < n; i++) m[i][y] = true;
						}if (redd1)
						{
							for (int i = 0; i < n; i++) m[i][y - 1] = true;
						}if (kol1)
						{
							for (int i = 0; i < n; i++) m[x - 1][i] = true;
						}
						fig.pop_back();
						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}br--;

					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; }  return; }
		}
		else if (f % 4 == 1)
		{
			bool stavali = false;
			for (int x = 0; x < n - 1; x =x+temp)
			{
				for (int y = 1; y < n; y = y+ temp)
				{
					if (!m[x][y] && !m[x + 1][y] && !m[x][y - 1])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25]; bool kolona = false, redd = false, redd1 = false, kol1 = false;
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								o[i][ii] = m[i][ii];
							}
						}
						kol[x] += 2; kol[x + 1] ++; red[y] += 2; red[y - 1] ++;
						m[x][y] = true; m[x + 1][y] = true;  m[x][y - 1] = true;

						if (kol[x] == n)
						{
							kolona = true;
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (kol[x + 1] == n)
						{
							kol1 = true;
							for (int i = 0; i < n; i++) m[x + 1][i] = false;
						}
						if (red[y] == n)
						{
							redd = true;
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						if (red[y - 1] == n)
						{
							redd1 = true;
							for (int i = 0; i < n; i++) m[i][y - 1] = false;
						}
						br++; pripromqnakol(m);
						fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);
						if (kolona)
						{
							for (int i = 0; i < n; i++) m[x][i] = true;
						}if (redd)
						{
							for (int i = 0; i < n; i++) m[i][y] = true;
						}if (redd1)
						{
							for (int i = 0; i < n; i++) m[i][y - 1] = true;
						}if (kol1)
						{
							for (int i = 0; i < n; i++) m[x + 1][i] = true;
						}
						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}fig.pop_back();
						br--;

					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; } return; }
		}
		else if (f % 4 == 2)
		{
			bool stavali = false;
			for (int x = 0; x < n - 1; x = x+ temp)
			{
				for (int y = 0; y < n - 1; y =y+temp)
				{
					if (!m[x][y] && !m[x + 1][y] && !m[x][y + 1])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25];
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								o[i][ii] = m[i][ii];
							}
						}
						kol[x] += 2; kol[x + 1] ++; red[y] += 2; red[y + 1] ++;
						m[x][y] = true; m[x + 1][y] = true;  m[x][y + 1] = true;
						bool kolona = false, redd = false, redd1 = false, kol1 = false;
						if (kol[x] == n)
						{
							kolona = true;
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (kol[x + 1] == n)
						{
							kol1 = true;
							for (int i = 0; i < n; i++) m[x + 1][i] = false;
						}
						if (red[y] == n)
						{
							redd = true;
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						if (red[y + 1] == n)
						{
							redd1 = true;
							for (int i = 0; i < n; i++) m[i][y + 1] = false;
						}
						br++; pripromqnakol(m);
						fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);
						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}fig.pop_back();
						br--;

					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; } return; }
		}
		else
		{
			bool stavali = false;
			for (int x = 1; x < n; x = x+ temp)
			{
				for (int y = 0; y < n - 1; y =y+temp)
				{
					if (!m[x][y] && !m[x - 1][y] && !m[x][y + 1])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25];
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								o[i][ii] = m[i][ii];
							}
						}
						kol[x] += 2; kol[x - 1] ++; red[y] += 2; red[y + 1] ++;
						m[x][y] = true; m[x - 1][y] = true; m[x][y + 1] = true;
						bool kolona = false, redd = false, redd1 = false, kol1 = false;
						if (kol[x] == n)
						{
							kolona = true;
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (kol[x - 1] == n)
						{
							kol1 = true;
							for (int i = 0; i < n; i++) m[x - 1][i] = false;
						}
						if (red[y] == n)
						{
							redd = true;
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						if (red[y + 1] == n)
						{
							redd1 = true;
							for (int i = 0; i < n; i++) m[i][y + 1] = false;
						}
						br++; pripromqnakol(m);
						fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);
						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}fig.pop_back();
						br--;

					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; }  return; }
		}
	}
	else if (c % 5 == 2)
	{
		if (f % 4 == 0)
		{
			bool stavali = false;
			for (int x = 2; x < n; x =x+temp)
			{
				for (int y = 1; y < n; y = y +temp)
				{
					if (!m[x][y] && !m[x - 1][y] && !m[x - 2][y] && !m[x][y - 1])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25];
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								o[i][ii] = m[i][ii];
							}
						}bool kolona = false, redd = false, redd1 = false, kol1 = false, koll2 = false;
						kol[x - 2]++; kol[x - 1]++; kol[x] += 2; red[y] += 3; red[y - 1]++;
						m[x][y] = true; m[x - 1][y] = true; m[x - 2][y] = true; m[x][y - 1] = true;
						if (kol[x] == n)
						{
							kolona = true;
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (kol[x - 1] == n)
						{
							kol1 = true;
							for (int i = 0; i < n; i++) m[x - 1][i] = false;
						}
						if (kol[x - 2] == n)
						{
							koll2 = true;
							for (int i = 0; i < n; i++) m[x - 2][i] = false;
						}
						if (red[y] == n)
						{
							redd = true;
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						if (red[y - 1] == n)
						{
							redd1 = true;
							for (int i = 0; i < n; i++) m[i][y - 1] = false;
						}
						br++; pripromqnakol(m);
						fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);

						fig.pop_back();
						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}br--;

					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; } return; }
		}
		else if (f % 4 == 1)
		{
			bool stavali = false;
			for (int x = 0; x < n - 1; x = x +temp)
			{
				for (int y = 2; y < n; y =y+temp)
				{
					if (!m[x][y] && !m[x + 1][y] && !m[x][y - 1] && !m[x][y - 2])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25];
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								o[i][ii] = m[i][ii];
							}
						}bool kolona = false, redd = false, redd1 = false, kol1 = false, redd2 = false;
						kol[x + 1]++; kol[x] += 3; red[y] += 2; red[y - 1]++; red[y - 2]++;
						m[x][y] = true; m[x + 1][y] = true; m[x][y - 1] = true; m[x][y - 2] = true;

						if (kol[x] == n)
						{
							bool kolona = true;
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (kol[x + 1] == n)
						{
							kol1 = true;
							for (int i = 0; i < n; i++) m[x + 1][i] = false;
						}
						if (red[y] == n)
						{
							redd = true;
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						if (red[y - 1] == n)
						{
							redd1 = true;
							for (int i = 0; i < n; i++) m[i][y - 1] = false;
						}
						if (red[y - 2] == n)
						{
							redd2 = true;
							for (int i = 0; i < n; i++) m[i][y - 2] = false;
						}
						br++; pripromqnakol(m);
						fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);
						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}fig.pop_back();
						br--;

					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; } return; }
		}
		else if (f % 4 == 2)
		{
			bool stavali = false;
			for (int x = 0; x < n - 2; x =x+temp)
			{
				for (int y = 0; y < n - 1; y = y+ temp)
				{
					if (!m[x][y] && !m[x + 1][y] && !m[x][y + 1] && !m[x + 2][y])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25];
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								o[i][ii] = m[i][ii];
							}
						}
						kol[x] += 2; kol[x + 1] ++; red[y] += 3; red[y + 1] ++; kol[x + 2]++;
						m[x][y] = true; m[x + 1][y] = true;  m[x][y + 1] = true; m[x + 2][y] = true;
						bool kolona = false, redd = false, redd1 = false, kol1 = false, koll2 = false;
						if (kol[x] == n)
						{
							kolona = true;
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (kol[x + 1] == n)
						{
							kol1 = true;
							for (int i = 0; i < n; i++) m[x + 1][i] = false;
						}
						if (red[y] == n)
						{
							redd = true;
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						if (red[y + 1] == n)
						{
							redd1 = true;
							for (int i = 0; i < n; i++) m[i][y + 1] = false;
						}
						if (kol[x + 2] == n)
						{
							koll2 = true;
							for (int i = 0; i < n; i++) m[x + 2][i] = false;
						}
						br++; pripromqnakol(m);
						fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);
						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}fig.pop_back();
						br--;

					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; }  return; }
		}
		else if (f % 4 == 3)
		{
			bool stavali = false;
			for (int x = 1; x < n; x =x+temp)
			{
				for (int y = 0; y < n - 2; y =y+temp)
				{
					if (!m[x][y] && !m[x - 1][y] && !m[x][y + 1] && !m[x][y + 2])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25];
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								o[i][ii] = m[i][ii];
							}
						}bool kolona = false, redd = false, redd1 = false, kol1 = false, redd2 = false;
						red[y] += 2; red[y + 1]++; red[y + 2]++; kol[x - 1]++; kol[x] += 3;
						m[x][y] = true; m[x - 1][y] = true; m[x][y + 1] = true, m[x][y + 2] = true;
						if (kol[x] == n)
						{
							kolona = true;
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (kol[x - 1] == n)
						{
							kol1 = true;
							for (int i = 0; i < n; i++) m[x - 1][i] = false;
						}
						if (red[y] == n)
						{
							redd = true;
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						if (red[y + 1] == n)
						{
							redd1 = true;
							for (int i = 0; i < n; i++) m[i][y + 1] = false;
						}
						if (red[y + 2] == n)
						{
							redd2 = true;
							for (int i = 0; i < n; i++) m[i][y + 2] = false;
						}
						br++; pripromqnakol(m);
						fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);
						fig.pop_back();;
						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}br--;

					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; }  return; }
		}

	}
	else if (c % 5 == 3)
	{
		if (f % 4 == 0 || f % 4 == 2)
		{
			bool stavali = false;
			for (int x = 0; x < n - 3; x = x + temp)
			{
				for (int y = 0; y < n; y =y+temp)
				{
					if (!m[x][y] && !m[x + 1][y] && !m[x + 2][y] && !m[x + 3][y])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25];
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								o[i][ii] = m[i][ii];
							}
						}
						m[x][y] = true; m[x + 1][y] = true; m[x + 2][y] = true, m[x + 3][y] = true;
						kol[x]++; kol[x + 1]++; kol[x + 2]++; kol[x + 3]++; red[y] += 4;
						if (kol[x] == n)
						{
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (kol[x + 1] == n)
						{
							for (int i = 0; i < n; i++) m[x + 1][i] = false;
						}
						if (kol[x + 2] == n)
						{
							for (int i = 0; i < n; i++) m[x + 2][i] = false;
						}
						if (kol[x + 3] == n)
						{
							for (int i = 0; i < n; i++) m[x + 3][i] = false;
						}
						if (red[y] == n)
						{
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						br++; pripromqnakol(m);
						if (f % 4 == 0) fig.push_back({ x + 4,y + 1 });
						else fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);

						fig.pop_back();
						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}br--;

					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; }return; }
		}
		else {
			bool stavali = false;
			for (int x = 0; x < n; x = x + temp)
			{
				for (int y = 0; y < n - 3; y =y+temp)
				{
					if (!m[x][y] && !m[x][y + 1] && !m[x][y + 2] && !m[x][y + 3])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25];
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								o[i][ii] = m[i][ii];
							}
						}bool kolona = false, redd = false, redd1 = false, redd2 = false, redd3 = false;
						kol[x] += 4; red[y] ++; red[y + 1] ++; red[y + 2] ++; red[y + 3] ++;
						m[x][y] = true; m[x][y + 3] = true; m[x][y + 1] = true, m[x][y + 2] = true;
						if (kol[x] == n)
						{
							kolona = true;
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (red[y + 1] == n)
						{
							redd1 = true;
							for (int i = 0; i < n; i++) m[i][y + 1] = false;
						}
						if (red[y + 2] == n)
						{
							redd2 = true;
							for (int i = 0; i < n; i++) m[i][y + 2] = false;
						}
						if (red[y + 3] == n)
						{
							redd3 = true;
							for (int i = 0; i < n; i++) m[i][y + 3] = false;
						}
						if (red[y] == n)
						{
							redd = true;
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						br++;
						pripromqnakol(m);
						if (f % 4 == 1) fig.push_back({ x + 1,y + 4 });
						else fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);
						fig.pop_back();
						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}br--;

					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; }  return; }
		}
	}
	else
	{
		if (f % 4 == 0)
		{
			bool stavali = false;
			for (int x = 1; x < n; x =x+temp)
			{
				for (int y = 2; y < n; y = y + temp)
				{
					if (!m[x][y] && !m[x][y - 1] && !m[x][y - 2] && !m[x - 1][y - 1])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25];
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								o[i][ii] = m[i][ii];
							}
						}bool kolona = false, redd = false, redd1 = false, kol1 = false, redd2 = false;
						kol[x] += 3; kol[x - 1]++; red[y]++; red[y - 1] += 2; red[y - 2]++;
						m[x][y] = true; m[x - 1][y - 1] = true; m[x][y - 1] = true; m[x][y - 2] = true;
						if (kol[x] == n)
						{
							kolona = true;
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (kol[x - 1] == n)
						{
							kol1 = true;
							for (int i = 0; i < n; i++) m[x - 1][i] = false;
						}
						if (red[y - 1] == n)
						{
							redd1 = true;
							for (int i = 0; i < n; i++) m[i][y - 1] = false;
						}
						if (red[y - 2] == n)
						{
							redd2 = true;
							for (int i = 0; i < n; i++) m[i][y - 2] = false;
						}
						if (red[y] == n)
						{
							redd = true;
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						br++;  pripromqnakol(m);
						fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);
						
						fig.pop_back();
						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}br--;

					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; } return; }
		}
		else if (f % 4 == 1)
		{
			bool stavali = false;
			for (int x = 0; x < n - 2; x = x + temp)
			{
				for (int y = 1; y < n; y =y+temp)
				{
					if (!m[x][y] && !m[x + 1][y - 1] && !m[x + 1][y] && !m[x + 2][y])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25];
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								o[i][ii] = m[i][ii];
							}
						}
						kol[x]++; kol[x + 1] += 2; kol[x + 2]++; red[y] += 3; red[y - 1]++;
						m[x][y] = true; m[x + 2][y] = true; m[x + 1][y - 1] = true; m[x + 1][y] = true;
						bool kolona = false, redd = false, redd1 = false, kol1 = false, koll2 = false;
						if (kol[x] == n)
						{
							kolona = true;
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (kol[x + 1] == n)
						{
							kol1 = true;
							for (int i = 0; i < n; i++) m[x + 1][i] = false;
						}
						if (kol[x + 2] == n)
						{
							koll2 = true;
							for (int i = 0; i < n; i++) m[x + 2][i] = false;
						}
						if (red[y - 1] == n)
						{
							redd1 = true;
							for (int i = 0; i < n; i++) m[i][y - 1] = false;
						}
						if (red[y] == n)
						{
							redd = true;
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						br++; pripromqnakol(m);
						fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);
						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}fig.pop_back();
						br--;

					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; } return; }
		}
		else if (f % 4 == 2)
		{
			bool stavali = false;
			for (int x = 0; x < n - 1; x =x+temp)
			{
				for (int y = 0; y < n - 2; y = y + temp)
				{
					if (!m[x][y] && !m[x][y + 1] && !m[x][y + 2] && !m[x + 1][y + 1])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25];
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								o[i][ii] = m[i][ii];
							}
						}bool kolona = false, redd = false, redd1 = false, kol1 = true, redd2 = false;
						kol[x] += 3; kol[x + 1]++; red[y]++; red[y + 1] += 2; red[y + 2]++;
						m[x][y] = true; m[x][y + 1] = true; m[x + 1][y + 1] = true; m[x][y + 2] = true;

						if (kol[x] == n)
						{
							kolona = true;
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (kol[x + 1] == n)
						{
							kol1 = true;
							for (int i = 0; i < n; i++) m[x + 1][i] = false;
						}
						if (red[y + 1] == n)
						{
							redd1 = true;
							for (int i = 0; i < n; i++) m[i][y + 1] = false;
						}
						if (red[y + 2] == n)
						{
							redd2 = true;
							for (int i = 0; i < n; i++) m[i][y + 2] = false;
						}
						if (red[y] == n)
						{
							redd = true;
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						br++;  pripromqnakol(m);
						fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);

						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}fig.pop_back();
						br--;

					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; }  return; }
		}
		else
		{
			bool stavali = false;
			for (int x = 2; x < n; x =x+temp)
			{
				for (int y = 0; y < n - 1; y = y +temp)
				{
					if (!m[x][y] && !m[x - 1][y + 1] && !m[x - 1][y] && !m[x - 2][y])
					{
						stavali = true;
						int kol2[25], red2[25];
						bool o[25][25];
						for (int i = 0; i < n; i++)
						{
							kol2[i] = kol[i]; red2[i] = red[i];
							for (int ii = 0; ii < n; ii++)
							{
								o[i][ii] = m[i][ii];
							}
						}bool kolona = false; bool redd = false, redd1 = false, kol1 = false, koll2 = false;
						m[x][y] = true; m[x - 2][y] = true; m[x - 1][y] = true; m[x - 1][y + 1] = true;
						kol[x]++; kol[x - 1] += 2; kol[x - 2]++; red[y] += 3; red[y + 1]++;
						if (kol[x] == n)
						{
							kolona = true;
							for (int i = 0; i < n; i++) m[x][i] = false;
						}
						if (kol[x - 1] == n)
						{
							kol1 = true;
							for (int i = 0; i < n; i++) m[x - 1][i] = false;
						}
						if (kol[x - 2] == n)
						{
							koll2 = true;
							for (int i = 0; i < n; i++) m[x - 2][i] = false;
						}
						if (red[y + 1] == n)
						{
							redd1 = true;
							for (int i = 0; i < n; i++) m[i][y + 1] = false;
						}
						if (red[y] == n)
						{
							redd = true;
							for (int i = 0; i < n; i++) m[i][y] = false;
						}
						br++; pripromqnakol(m);
						fig.push_back({ x + 1,y + 1 });
						rec(m, f, c);
						
						for (int i = 0; i < n; i++) {
							kol[i] = kol2[i]; red[i] = red2[i];
							for (int ii = 0; ii < n; ii++)
							{
								m[i][ii] = o[i][ii];
							}
						}fig.pop_back();
						br--;

					}
				}
			}
			if (!stavali) { if (maks < br) { maks = br; ans = fig; }return; }
		}
	}

}
int main()
{
	ios_base::sync_with_stdio(false);
	cinn.open("block.in", ios_base::in);
	coutt.open("block.out", ios_base::out);
	cinn.tie(0); coutt.tie(0);
	cinn >> n >> a >> b >> C >> d >> e >> F;
	rec(fal, F, C);
	coutt << maks << "\n";
	if (n == 8) temp = 1;
	for (auto a : ans)
	{
		coutt << a.second << " " << a.first << "\n";
	}
}