#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (int i = (int)x; i < (int)limit; i++)
#define REP(i, x, limit) for (int i = (int)x; i <= (int)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll n;cin>>n;
  if(n<=2){
    cout<<-1<<el;
    return 0;
  }
  auto ok=[&](ll x,ll y){
    if(0<=x&&x<n&&y>=0&&y<n)return true;
    return false;
  };
  vl X={0,1,-1,1},Y={1,0,1,1};
  auto ridx=[&](ll x,ll y){
    return x*n+y+1;
  };
  vector<pll> ans;
  rep(i,0,n)rep(j,0,n){
    rep(k,0,4){
      ll nx=i+X[k],ny=j+Y[k];
      if(ok(nx,ny))ans.push_back({ridx(i,j),ridx(nx,ny)});
    }
  }
  ans.push_back({ridx(0,0),ridx(n-1,0)});
  ans.push_back({ridx(0,n-1),ridx(n-1,n-1)});
  cout<<ans.size()<<el;
  for(auto[a,b]:ans){
    cout<<a<<spa<<b<<el;
  }
}