#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

using ll=long long;
using ldub=long double;
using lldub=__float128;
using str=string;

using mint=modint;

template<class T=ll>
using tup2=tuple<T,T>;
template<class T=ll>
using tup3=tuple<T,T,T>;
template<class T=ll>
using tup4=tuple<T,T,T,T>;
template<class T=ll>
using tup5=tuple<T,T,T,T,T>;
template<class T=ll>
using tup6=tuple<T,T,T,T,T,T>;
template<class T=ll>
using tup7=tuple<T,T,T,T,T,T,T>;

template<class T=ll>
using vec=vector<T>;
template<class T=ll>
using vec2=vector<vec<T>>;
template<class T=ll>
using vec3=vector<vec2<T>>;
template<class T=ll>
using vec4=vector<vec3<T>>;
template<class T=ll>
using vec5=vector<vec4<T>>;
template<class T=ll>
using vec6=vector<vec5<T>>;

template<class T>
using que=queue<T>;
template<class T>
using Pque=priority_queue<T>;
template<class T>
using pque=priority_queue<T, vector<T>, greater<T>>;

struct Edge{
  ll from,to,w=1,num=-1;
};
using gvec=vector<Edge>;
using gvec2=vector<gvec>;

template<class T>
bool chmax(T &a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>
bool chmin(T &a,T b){if(b<a){a=b;return 1;}return 0;}

#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define ins insert
#define tup make_tuple
#define low lower_bound
#define pops(a) __builtin_popcountll(a)
#define ctz(a) __builtin_ctzll(a)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define nperm(v) next_permutation(all(v))
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YN(f) cout << ((f)?"Yes":"No") << endl

const int IINF=2e9;
const ll INF=4e18;

#ifndef LOCAL
#define debug(x)
#endif




// =================================================




void solve(){
  ll N;
  cin >> N;
  if(N<=3){
    cout << -1 << endl;
    return;
  }
  if((N&1)==0){
    cout << 1 << ' ' << 2 << endl;
    cout << 1 << ' ' << N+1 << endl;
    cout << 2 << ' ' << N+2 << endl;
    cout << 3 << ' ' << 4 << endl;
    cout << 4 << ' ' << N+4 << endl;
    cout << N+2 << ' ' << N+3 << endl;
    cout << N+3 << ' ' << N+4 << endl;
    cout << N+3 << ' ' << 2*N+3 << endl;
    cout << 2*N+1 << ' ' << 2*N+2 << endl;
    cout << 2*N+1 << ' ' << 3*N+1 << endl;
    cout << 2*N+3 << ' ' << 2*N+4 << endl;
    cout << 2*N+3 << ' ' << 3*N+3 << endl;
    cout << 2*N+4 << ' ' << 3*N+4 << endl;
    cout << 3*N+1 << ' ' << 3*N+2 << endl;
    cout << 3*N+2 << ' ' << 3*N+3 << endl;
    for(ll p=4;p<N;p++){
      if((p&1)==0){
        cout << p*N+p+1 << ' ' << p*N+p+2 << endl;
        cout << p*N+p+2 << ' ' << (p-1)*N+p+2 << endl;
        cout << (p-1)*N+p+1 << ' ' << (p-1)*N+p+2 << endl;
        cout << (p-2)*N+p+1 << ' ' << (p-1)*N+p+1 << endl;
        cout << (p-2)*N+p+1 << ' ' << (p-2)*N+p+2 << endl;
        for(ll i=0;i<p-2;i++) cout << i*N+p+2 << ' ' << (i+1)*N+p+2 << endl;
        cout << p+1 << ' ' << p+2 << endl;
        for(ll i=0;i<p-3;i++) cout << i*N+p+1 << ' ' << (i+1)*N+p+1 << endl;
        cout << (p-3)*N+p << ' ' << (p-3)*N+p+1 << endl;
      }else{
        cout << p*N+p << ' ' << p*N+p+1 << endl;
        cout << p*N+p-1 << ' ' << p*N+p << endl;
        cout << (p-1)*N+p-1 << ' ' << p*N+p-1 << endl;
        cout << (p-1)*N+p-2 << ' ' << (p-1)*N+p-1 << endl;
        cout << (p-1)*N+p-2 << ' ' << p*N+p-2 << endl;
        for(ll i=0;i<p-3;i++) cout << p*N+i+1 << ' ' << p*N+i+2 << endl;
        cout << (p-1)*N+1 << ' ' << p*N+1 << endl;
        for(ll i=0;i<p-4;i++) cout << (p-1)*N+i+1 << ' ' << (p-1)*N+i+2 << endl;
        cout << (p-2)*N+p-3 << ' ' << (p-1)*N+p-3 << endl;
      }
    }
  }else{
    cout << 1 << ' ' << 2 << endl;
    cout << 1 << ' ' << N+1 << endl;
    cout << 2 << ' ' << N+2 << endl;
    cout << 3 << ' ' << 4 << endl;
    cout << 4 << ' ' << 5 << endl;
    cout << 5 << ' ' << N+5 << endl;
    cout << N+2 << ' ' << N+3 << endl;
    cout << N+3 << ' ' << N+4 << endl;
    cout << N+3 << ' ' << 2*N+3 << endl;
    cout << N+4 << ' ' << N+5 << endl;
    cout << 2*N+1 << ' ' << 2*N+2 << endl;
    cout << 2*N+1 << ' ' << 3*N+1 << endl;
    cout << 2*N+3 << ' ' << 2*N+4 << endl;
    cout << 2*N+3 << ' ' << 3*N+3 << endl;
    cout << 2*N+4 << ' ' << 2*N+5 << endl;
    cout << 2*N+5 << ' ' << 3*N+5 << endl;
    cout << 3*N+1 << ' ' << 3*N+2 << endl;
    cout << 3*N+1 << ' ' << 4*N+1 << endl;
    cout << 3*N+2 << ' ' << 3*N+3 << endl;
    cout << 3*N+4 << ' ' << 4*N+4 << endl;
    cout << 3*N+5 << ' ' << 4*N+5 << endl;
    cout << 4*N+1 << ' ' << 4*N+2 << endl;
    cout << 4*N+2 << ' ' << 4*N+3 << endl;
    cout << 4*N+3 << ' ' << 4*N+4 << endl;
    for(ll p=5;p<N;p++){
      if((p&1)==1){
        cout << p*N+p+1 << ' ' << p*N+p+2 << endl;
        cout << p*N+p+2 << ' ' << (p-1)*N+p+2 << endl;
        cout << (p-1)*N+p+1 << ' ' << (p-1)*N+p+2 << endl;
        cout << (p-2)*N+p+1 << ' ' << (p-1)*N+p+1 << endl;
        cout << (p-2)*N+p+1 << ' ' << (p-2)*N+p+2 << endl;
        for(ll i=0;i<p-2;i++) cout << i*N+p+2 << ' ' << (i+1)*N+p+2 << endl;
        cout << p+1 << ' ' << p+2 << endl;
        for(ll i=0;i<p-3;i++) cout << i*N+p+1 << ' ' << (i+1)*N+p+1 << endl;
        cout << (p-3)*N+p << ' ' << (p-3)*N+p+1 << endl;
      }else{
        cout << p*N+p << ' ' << p*N+p+1 << endl;
        cout << p*N+p-1 << ' ' << p*N+p << endl;
        cout << (p-1)*N+p-1 << ' ' << p*N+p-1 << endl;
        cout << (p-1)*N+p-2 << ' ' << (p-1)*N+p-1 << endl;
        cout << (p-1)*N+p-2 << ' ' << p*N+p-2 << endl;
        for(ll i=0;i<p-3;i++) cout << p*N+i+1 << ' ' << p*N+i+2 << endl;
        cout << (p-1)*N+1 << ' ' << p*N+1 << endl;
        for(ll i=0;i<p-4;i++) cout << (p-1)*N+i+1 << ' ' << (p-1)*N+i+2 << endl;
        cout << (p-2)*N+p-3 << ' ' << (p-1)*N+p-3 << endl;
      }
    }
  }
}

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

  mint::set_mod(998244353);
  // mint::set_mod(1000000007);

  ll T=1;
  // cin >> T;
  while(T--) solve();
  return 0;
}