#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define __builtin_ctz __builtin_ctzll
#define __builtin_clz __builtin_clzll
#define __builtin_popcount __builtin_popcountll
using namespace std;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',') { cerr<<*sdbg++; } cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define cerr if(0)cout
#endif
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
template<class T> void ResizeVec(T&, vector<int>) {}
template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
  vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
  for (T& v : vec) { ResizeVec(v, sz); }
}
typedef Triple<int, int, int> TIII;
template<class A, class B, class C>
ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class T> ostream& operator<<(ostream& out, set<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class L, class R> ostream& operator<<(ostream& out, map<L, R> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }

int di[] = {1, -1, 0, 0};
int dj[] = {0, 0, 1, -1};

int32_t main() {

  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  cerr << fixed << setprecision(10);
  cin.tie(0);
  //double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
  
  int k;
  cin>>k;
  VVI board;
  if (k <= 7) {
    cout<<k<<endl;
    board = VVI(k + 1, VI(k + 1));
    RE (i, k) {
      RE (j, k) {
        board[i][j] = i;
        //cout<<i<<" ";
      }
      //cout<<endl;
    }
  } else {
    if (k % 4 == 0) {
      board = VVI(k / 2 + 1, VI(k / 2 + 1));
      cout<<k/2<<endl;
      RE (i, k / 2) {
        RE (j, k / 2) {
          board[i][j] = i + (j % 2) * (k / 2);
        }
      }
    } else {
      if (k % 4 == 3) {
        int bok = (k + 1) / 2;
        board = VVI(bok + 1, VI(bok + 1));
        cout<<bok<<endl;
        RE (i, bok) {
          RE (j, bok) {
            if (i == j) {
              board[i][j] = 1;
              //cout<<"1 ";
            } else {
              int diff = i - j;
              if (diff < 0) {
                diff += bok;
              }
              board[i][j] = 2 * diff + (i % 2);
            }
          }
        }
      } else if (k % 4 == 1) {
        int bok = (k + 3) / 2;
        board = VVI(bok + 1, VI(bok + 1));
        cout<<bok<<endl;
        RE (i, bok) {
          RE (j, bok) {
            if (i == j) {
              //cout<<"1 ";
              board[i][j] = 1;
            } else {
              int diff = i - j;
              if (diff < 0) {
                diff += bok;
              }
              int col = 2 * diff + (i % 2);
              if (col == k) {
                col = k - 1;
              } else if (col > k) {
                col = k;
              }
              board[i][j] = col;
              //cout<<col<<" ";
            }
          }
          //cout<<"\n";
        }
      } else if (k % 4 == 2) {
        int bok = (k + 2) / 2;
        board = VVI(bok + 1, VI(bok + 1));
        cout<<bok<<endl;
        RE (i, bok) {
          RE (j, bok) {
            if (i == j) {
              //cout<<"1 ";
              board[i][j] = 1;
            } else {
              int diff = i - j;
              if (diff < 0) {
                diff += bok;
              }
              int col = 2 * diff + (i % 2);
              mini(col, k);
              board[i][j] = col;
              //cout<<col<<" ";
            }
          }
        }
      }
    }
  }
  int bok = SZ(board) - 1;
  assert(bok <= 500);
  RE (i, bok) {
    RE (j, bok) {
      cout<<board[i][j]<<" ";
    }
    cout<<endl;
  }
  auto Rigcz = [&](int& x) {
    if (x == 0) { x = bok; }
    if (x == bok + 1) { x = 1; }
  };
  map<int, map<int, int>> mapki;
  RE (i, bok) {
    RE (j, bok) {
      map<int, int> here;
      REP (dir, 4) {
        int ni = i + di[dir];
        int nj = j + dj[dir];
        Rigcz(ni);
        Rigcz(nj);
        here[board[ni][nj]]++;
      }
      if (mapki.count(board[i][j])) {
        assert(mapki[board[i][j]] == here);
      } else {
        mapki[board[i][j]] = here;
      }
    }
  }
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  return 0;
}


Measured memory_bytes: 3584