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

#define all(v) v.begin(),v.end()
using ll = long long;
using ull = unsigned long long;
using lll = __int128;
using vll=vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll,ll>;
using vp=vector<pair<ll, ll>>;
using ld = long double;
//using mint=modint1000000007;
//using mint=modint998244353;

const ll INF=1ll<<60;
ll mod10=1e9+7;
ll mod99=998244353;
const double PI = acos(-1);

#define rep(i,n) for (ll i=0;i<n;++i)
#define per(i,n) for(ll i=(n)-1;i>=0;--i)
#define rep2(i,a,n) for (ll i=a;i<n;++i)
#define per2(i,a,n) for (ll i=a;i>=n;--i)

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

bool solve(){
    ll N;cin>>N;
    vvll ans1(N,vll(N)),ans2(N,vll(N));
    rep(i,N){
        rep(j,N){
            ans1[i][j]=i+1;
            ans2[i][j]=j+1;
        }
    }
    rep(i,N) rep(j,N){
        if(i>j&&(i-j%2+2)%2==0){
            
            swap(ans1[i][j],ans1[j][i]);
            swap(ans2[i][j],ans2[j][i]);
        }
    }

    rep(i,N) {
        rep(j,N) cout<<ans1[i][j]<<" \n"[j==N-1];
    }
    rep(i,N) rep(j,N) cout<<ans2[i][j]<<" \n"[j==N-1];


    rep(i,N) rep(j,N) cerr<<ans1[i][j]-ans2[i][j]<<" \n"[j==N-1];
    return 0;
}
   




int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll T=1;//cin>>T;
    rep(i,T) while(solve());
}