/*
 * @Author:             cmk666
 * @Created time:       2023-11-25 14:56:02
 * @Last Modified time: 2023-11-25 15:38:52
 */
#pragma GCC optimize("Ofast", "unroll-loops")
#include<bits/stdc++.h>
#ifdef LOCAL
#include"debug.h"
#else
#define D(...) ((void)0)
#endif
using namespace std; using ll = long long;
#define For(i, j, k) for ( int i = (j) ; i <= (k) ; i++ )
#define Fol(i, j, k) for ( int i = (j) ; i >= (k) ; i-- )
namespace FastIO
{
// ------------------------------
// #define IN_HAS_NEG
// #define OUT_HAS_NEG
// #define CHK_EOF
// #define DISABLE_MMAP
// ------------------------------
#if __cplusplus < 201400
#error Please use C++14 or higher.
#endif
#if __cplusplus > 201700
#define INLINE_V inline
#else
#define INLINE_V
#endif
#if ( defined(LOCAL) || defined(_WIN32) ) && !defined(DISABLE_MMAP)
#define DISABLE_MMAP
#endif
#ifndef DISABLE_MMAP
#include<sys/mman.h>
#endif
#ifdef LOCAL
	inline char gc() { return getchar(); }
	inline void pc(char c) { putchar(c); }
#else
#ifdef DISABLE_MMAP
	INLINE_V constexpr int _READ_SIZE = 1 << 18;
	INLINE_V static char _read_buffer[_READ_SIZE], *_read_ptr = nullptr, *_read_ptr_end = nullptr;
	inline char gc()
	{
		if ( __builtin_expect(_read_ptr == _read_ptr_end, false) )
		{
			_read_ptr = _read_buffer;
			_read_ptr_end = _read_buffer + fread(_read_buffer, 1, _READ_SIZE, stdin);
#ifdef CHK_EOF
			if ( __builtin_expect(_read_ptr == _read_ptr_end, false) ) return EOF;
#endif
		}
		return *_read_ptr++;
	}
#else
	INLINE_V static const char *_read_ptr = (const char *)mmap(nullptr, INT_MAX, 1, 2, 0, 0);
	inline char gc() { return *_read_ptr++; }
#endif
	INLINE_V constexpr int _WRITE_SIZE = 1 << 18;
	INLINE_V static char _write_buffer[_WRITE_SIZE], *_write_ptr = _write_buffer;
	inline void pc(char c)
	{
		*_write_ptr++ = c;
		if ( __builtin_expect(_write_buffer + _WRITE_SIZE == _write_ptr, false) )
		{
			fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
			_write_ptr = _write_buffer;
		}
	}
	INLINE_V struct _auto_flush
	{
		inline ~_auto_flush() { fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout); }
	}	_auto_flush;
#endif
#ifdef CHK_EOF
	inline constexpr bool _isdigit(char c) { return ( c & 16 ) && c != EOF; }
	inline constexpr bool _isgraph(char c) { return c > 32 && c != EOF; }
#else
	inline constexpr bool _isdigit(char c) { return c & 16; }
	inline constexpr bool _isgraph(char c) { return c > 32; }
#endif
	template < class T >
	INLINE_V constexpr bool _is_integer = numeric_limits < T >::is_integer;
	template < class T >
	INLINE_V constexpr bool _is_signed = numeric_limits < T >::is_signed;
	template < class T >
	INLINE_V constexpr bool _is_unsigned = _is_integer < T > && !_is_signed < T >;
	template <> INLINE_V constexpr bool _is_integer < __int128 > = true;
	template <> INLINE_V constexpr bool _is_integer < __uint128_t > = true;
	template <> INLINE_V constexpr bool _is_signed < __int128 > = true;
	template <> INLINE_V constexpr bool _is_unsigned < __uint128_t > = true;
#undef INLINE_V
	inline void read(char &c) { do c = gc(); while ( !_isgraph(c) ); }
	inline void read_cstr(char *s)
	{
		char c = gc(); while ( !_isgraph(c) ) c = gc();
		while ( _isgraph(c) ) *s++ = c, c = gc();
		*s = 0;
	}
	inline void read(string &s)
	{
		char c = gc(); s.clear(); while ( !_isgraph(c) ) c = gc();
		while ( _isgraph(c) ) s.push_back(c), c = gc();
	}
#ifdef IN_HAS_NEG
	template < class T, enable_if_t < _is_signed < T >, int > = 0 >
	inline void read(T &x)
	{
		char c = gc(); bool f = true; x = 0;
		while ( !_isdigit(c) ) { if ( c == 45 ) f = false; c = gc(); }
		if ( f ) while ( _isdigit(c) ) x = x * 10 + ( c & 15 ), c = gc();
		else     while ( _isdigit(c) ) x = x * 10 - ( c & 15 ), c = gc();
	}
	template < class T, enable_if_t < _is_unsigned < T >, int > = 0 >
#else
	template < class T, enable_if_t < _is_integer < T >, int > = 0 >
#endif
	inline void read(T &x)
	{
		char c = gc(); while ( !_isdigit(c) ) c = gc();
		x = 0; while ( _isdigit(c) ) x = x * 10 + ( c & 15 ), c = gc();
	}
	inline void write(char c) { pc(c); }
	inline void write_cstr(const char *s) { while ( *s ) pc(*s++); }
	inline void write(const string &s) { for ( char c : s ) pc(c); }
#ifdef OUT_HAS_NEG
	template < class T, enable_if_t < _is_signed < T >, int > = 0 >
	inline void write(T x)
	{
		char buffer[numeric_limits < T >::digits10 + 1]; int digits = 0;
		if ( x >= 0 )  do buffer[digits++] =  ( x % 10 ) | 48, x /= 10; while ( x );
		else { pc(45); do buffer[digits++] = -( x % 10 ) | 48, x /= 10; while ( x ); }
		while ( digits ) pc(buffer[--digits]);
	}
	template < class T, enable_if_t < _is_unsigned < T >, int > = 0 >
#else
	template < class T, enable_if_t < _is_integer < T >, int > = 0 >
#endif
	inline void write(T x)
	{
		char buffer[numeric_limits < T >::digits10 + 1]; int digits = 0;
		do buffer[digits++] = ( x % 10 ) | 48, x /= 10; while ( x );
		while ( digits ) pc(buffer[--digits]);
	}
	template < int N > struct _tuple_io_helper
	{
		template < class ...T >
		static inline void _read(tuple < T... > &x)
		{ _tuple_io_helper < N - 1 >::_read(x), read(get < N - 1 > (x)); }
		template < class ...T >
		static inline void _write(const tuple < T... > &x)
		{ _tuple_io_helper < N - 1 >::_write(x), pc(32), write(get < N - 1 > (x)); }
	};
	template <> struct _tuple_io_helper < 1 >
	{
		template < class ...T >
		static inline void _read(tuple < T... > &x) { read(get < 0 > (x)); }
		template < class ...T >
		static inline void _write(const tuple < T... > &x) { write(get < 0 > (x)); }
	};
	template < class ...T >
	inline void read(tuple < T... > &x) { _tuple_io_helper < sizeof...(T) >::_read(x); }
	template < class ...T >
	inline void write(const tuple < T... > &x) { _tuple_io_helper < sizeof...(T) >::_write(x); }
	template < class T1, class T2 >
	inline void read(pair < T1, T2 > &x) { read(x.first), read(x.second); }
	template < class T1, class T2 >
	inline void write(const pair < T1, T2 > &x) { write(x.first), pc(32), write(x.second); }
	template < class T1, class ...T2 >
	inline void read(T1 &x, T2 &...y) { read(x), read(y...); }
	template < class ...T >
	inline void read_cstr(char *x, T *...y) { read_cstr(x), read_cstr(y...); }
	template < class T1, class ...T2 >
	inline void write(const T1 &x, const T2 &...y) { write(x), write(y...); }
	template < class ...T >
	inline void write_cstr(const char *x, const T *...y) { write_cstr(x), write_cstr(y...); }
	template < class T >
	inline void print(const T &x) { write(x); }
	inline void print_cstr(const char *x) { write_cstr(x); }
	template < class T1, class ...T2 >
	inline void print(const T1 &x, const T2 &...y) { print(x), pc(32), print(y...); }
	template < class ...T >
	inline void print_cstr(const char *x, const T *...y) { print_cstr(x), pc(32), print_cstr(y...); }
	inline void println() { pc(10); }
	inline void println_cstr() { pc(10); }
	template < class ...T >
	inline void println(const T &...x) { print(x...), pc(10); }
	template < class ...T >
	inline void println_cstr(const T *...x) { print_cstr(x...), pc(10); }
}
using namespace FastIO;
int n, c, ans[2009][2009];
inline void solve(int n, int d = 0)
{
#define a(x, y) ans[x + d][y]
	switch ( n & 3 )
	{
	case 0:
		for ( int i = 1 ; i != n + 1 ; i += 2 ) for ( int j = 1 ; j != n + 1 ; j += 4 )
			a(i, j    ) = a(i, j + 1) = a(i + 1, j    ) = a(i + 1, j + 2) = ++c,
			a(i, j + 2) = a(i, j + 3) = a(i + 1, j + 1) = a(i + 1, j + 3) = ++c;
		break;
	case 1:
		if ( n == 1 ) break;
		if ( n == 5 )
		{
			a(1, 1) = a(1, 3) = a(2, 1) = a(2, 2) = ++c;
			a(1, 2) = a(1, 4) = a(2, 3) = a(2, 4) = ++c;
			a(3, 1) = a(3, 2) = a(4, 2) = a(5, 1) = ++c;
			a(4, 1) = a(4, 3) = a(5, 2) = a(5, 3) = ++c;
			a(2, 5) = a(3, 4) = a(4, 4) = a(4, 5) = ++c;
			break;
		}
		if ( n == 9 )
		{
			a(1, 1) = a(1, 2) = a(2, 1) = a(3, 2) = ++c;
			a(2, 2) = a(3, 1) = a(4, 1) = a(4, 2) = ++c;
			a(1, 3) = a(1, 4) = a(2, 3) = a(2, 5) = ++c;
			a(1, 5) = a(1, 6) = a(2, 4) = a(2, 6) = ++c;
			a(1, 7) = a(1, 8) = a(2, 7) = a(2, 9) = ++c;
			a(1, 9) = a(2, 8) = a(3, 8) = a(3, 9) = ++c;
			a(3, 3) = a(4, 4) = a(5, 3) = a(5, 4) = ++c;
			a(3, 4) = a(3, 5) = a(4, 3) = a(4, 5) = ++c;
			a(3, 6) = a(3, 7) = a(4, 7) = a(5, 6) = ++c;
			a(4, 6) = a(5, 5) = a(6, 5) = a(6, 6) = ++c;
			a(4, 8) = a(4, 9) = a(5, 9) = a(6, 8) = ++c;
			a(5, 7) = a(5, 8) = a(6, 7) = a(6, 9) = ++c;
			a(5, 1) = a(5, 2) = a(6, 1) = a(6, 3) = ++c;
			a(6, 2) = a(6, 4) = a(7, 3) = a(7, 4) = ++c;
			a(7, 1) = a(7, 2) = a(8, 1) = a(9, 2) = ++c;
			a(8, 2) = a(8, 3) = a(9, 1) = a(9, 3) = ++c;
			a(8, 4) = a(8, 5) = a(9, 4) = a(9, 6) = ++c;
			a(7, 5) = a(7, 6) = a(8, 6) = a(9, 5) = ++c;
			a(7, 7) = a(7, 9) = a(8, 8) = a(8, 9) = ++c;
			a(7, 8) = a(8, 7) = a(9, 7) = a(9, 8) = ++c;
			break;
		}
		solve(n - 4, d + 2);
		for ( int i = 1 ; i != n - 4 ; i += 4 )
			a(    1, i    ) = a(    1, i + 1) = a(    2, i    ) = a(    2, i + 2) = ++c,
			a(    1, i + 2) = a(    1, i + 3) = a(    2, i + 1) = a(    2, i + 3) = ++c,
			a(n - 1, i    ) = a(n - 1, i + 1) = a(n    , i    ) = a(n    , i + 2) = ++c,
			a(n - 1, i + 2) = a(n - 1, i + 3) = a(n    , i + 1) = a(n    , i + 3) = ++c,
			a(i    , n - 1) = a(i + 1, n - 1) = a(i    , n    ) = a(i + 2, n    ) = ++c,
			a(i + 2, n - 1) = a(i + 3, n - 1) = a(i + 1, n    ) = a(i + 3, n    ) = ++c;
		for ( int i = 4 ; i != n - 5 ; i += 4 )
			a(i    , n - 3) = a(i + 1, n - 3) = a(i    , n - 2) = a(i + 2, n - 2) = ++c,
			a(i + 2, n - 3) = a(i + 3, n - 3) = a(i + 1, n - 2) = a(i + 3, n - 2) = ++c;
		a(    1, n - 4) = a(    1, n - 3) = a(    2, n - 4) = a(    2, n - 2) = ++c,
		a(    1, n - 2) = a(    2, n - 3) = a(    3, n - 3) = a(    3, n - 2) = ++c,
		a(n - 5, n - 3) = a(n - 5, n - 2) = a(n - 4, n - 3) = a(n - 4, n - 1) = ++c,
		a(n - 4, n - 2) = a(n - 4, n    ) = a(n - 3, n - 1) = a(n - 3, n    ) = ++c,
		a(n - 3, n - 3) = a(n - 3, n - 2) = a(n - 2, n - 2) = a(n - 1, n - 3) = ++c,
		a(n - 2, n - 3) = a(n - 1, n - 4) = a(n    , n - 4) = a(n    , n - 3) = ++c,
		a(n - 2, n - 1) = a(n - 2, n    ) = a(n - 1, n    ) = a(n    , n - 1) = ++c,
		a(n - 1, n - 2) = a(n - 1, n - 1) = a(n    , n - 2) = a(n    , n    ) = ++c;
		break;
	case 2:
		solve(n - 2, d);
		for ( int i = 1 ; i != n - 1 ; i += 4 )
			a(n - 1, i    ) = a(n - 1, i + 1) = a(n    , i    ) = a(n    , i + 2) = ++c,
			a(n - 1, i + 2) = a(n - 1, i + 3) = a(n    , i + 1) = a(n    , i + 3) = ++c,
			a(i    , n - 1) = a(i + 1, n - 1) = a(i    , n    ) = a(i + 2, n    ) = ++c,
			a(i + 2, n - 1) = a(i + 3, n - 1) = a(i + 1, n    ) = a(i + 3, n    ) = ++c;
		break;
	case 3:
		solve(n - 2, d);
		for ( int i = 1 ; i != n - 2 ; i += 4 )
			a(n - 1, i    ) = a(n - 1, i + 1) = a(n    , i    ) = a(n    , i + 2) = ++c,
			a(n - 1, i + 2) = a(n - 1, i + 3) = a(n    , i + 1) = a(n    , i + 3) = ++c,
			a(i    , n - 1) = a(i + 1, n - 1) = a(i    , n    ) = a(i + 2, n    ) = ++c,
			a(i + 2, n - 1) = a(i + 3, n - 1) = a(i + 1, n    ) = a(i + 3, n    ) = ++c;
		a(n - 1, n - 2) = a(n - 1, n - 1) = a(n    , n - 2) = a(n    , n    ) = ++c,
		a(n - 2, n - 1) = a(n - 2, n    ) = a(n - 1, n    ) = a(n    , n - 1) = ++c;
		break;
	}
#undef a
}
inline void work()
{
	read(n), c = 0;
	For(i, 1, n) For(j, 1, n) ans[i][j] = 0;
	solve(n), println(c);
	For(i, 1, n) For(j, 1, n) write(ans[i][j], j == n ? '\n' : ' ');
}
int main() { int t; read(t); For(tt, 1, t) work(); return 0; }
// 想上GM捏 想上GM捏 想上GM捏 想上GM捏 想上GM捏
// 伊娜可爱捏 伊娜贴贴捏