#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
#include <climits>
#include <iomanip>
using namespace std;

void solve([[maybe_unused]] int t)
{
  int n;
  cin >> n;

  int siz = n + (18 - (n % 18 == 0 ? 18 : n % 18));
  int c = 10 + n * n / 100;

  vector mat(n, vector<int>(n));
  for (int i = 0; i < n; i++)
  {
    for (int j = 0; j < n; j++)
    {
      mat[i][j] = 1 + j / 18 + i / 8 * (siz / 18);
      assert(mat[i][j] >= 1 && mat[i][j] <= c);
      cout << mat[i][j] << " ";
    }
    cout << "\n";
  }
  /*
  for (int i = 0; i < n; i++)
  {
    for (int j = 0; j < n; j++)
    {
      set<int> ds;
      for (int k = 0; k < n; k++)
      {
        for (int l = 0; l < n; l++)
        {
          if ((i - k) * (i - k) + (j - l) * (j - l) <= 100)
            ds.insert(mat[k][l]);
        }
      }
      if (ds.size() > 8)
      {
        cout << i << " " << j << "\n";
        return;
      }
    }
  }
  */
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);

  int n = 1;
  // cin >> n;
  for (int i = 1; i <= n; i++)
    solve(i);
}