#pragma GCC optimize("Ofast") #include using namespace std; using ll = long long int ; using ld = long double ; using P = pair; using Graph= vector>; struct edge{ll to ; ll cost ;} ; using graph =vector> ; #define rep(i,n) for (ll i=0; i < (n); ++i) #define rep2(i,n,m) for(ll i=n;i<=m;i++) #define rep3(i,n,m) for(ll i=n;i>=m;i--) #define pb push_back #define eb emplace_back #define ppb pop_back #define mpa make_pair #define fi first #define se second #define set20 cout<= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;} mint operator+(const mint a) const { return mint(*this) += a;} mint operator-(const mint a) const { return mint(*this) -= a;} mint operator*(const mint a) const { return mint(*this) *= a;} mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // for prime mod mint inv() const { return pow(mod-2);} mint& operator/=(const mint a) { return *this *= a.inv();} mint operator/(const mint a) const { return mint(*this) /= a;} }; istream& operator>>(istream& is, const mint& a) { return is >> a.x;} ostream& operator<<(ostream& os, const mint& a) { return os << a.x;} //昆布 struct combination { vector fact, ifact; combination(int n):fact(n+1),ifact(n+1) { assert(n < mod); //任意modではここ消すcombmain内に fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i; } mint operator()(int n, int k) { if (k < 0 || k > n) return 0; return fact[n]*ifact[k]*ifact[n-k]; } mint p(int n,int k){ return fact[n]*ifact[n-k] ; //kは個数 } } c(5005) ; mint modpow(ll a,ll b){ if(b==0) return 1 ; mint c= modpow(a,b/2) ; if(b%2==1) return c*c*a ; else return c*c ; } mint mmodpow(mint a,ll b){ if(b==0) return 1ll ; mint c=mmodpow(a,(b/2)) ; if(b%2==1) return c*c*a ; else return c*c ; } mint komb(ll n,ll m){ mint x=1 ;mint y=1 ; rep(i,m){ x*= n-i ; y*= i+1 ; } return x/y ; } map factor(ll n){ //素因数とオーダーをマップで管理 map ord ; for(ll i=2;i*i<=n;i++){ if(n%i==0){ int res=0; while(n%i==0){ n/=i; res++; } ord[i]=res; } } if(n!=1) ord[n]++; return ord ; } int main(){ ios::sync_with_stdio(false) ; cin.tie(nullptr) ; ll n;cin>>n; ll m=2*n-1; cout<> ans; rep(i,n-1){ vector num(2*n); rep(j,i+1) num[2*n-1-j]++; rep(j,2*n-(i+1)) num[2*n-1-j]++; vector bns; rep(j,n-1) bns.pb(2*n-1-j); bns.pb(i+1); ans.pb(bns); for(auto u:bns) num[u]--; vector cns; rep(i,2*n) if(num[i]) cns.pb(i); ans.pb(cns); } vector add; rep(i,n) add.pb(2*n-1-i); ans.pb(add); rep(i,m){ for(auto u:ans[i]) cout<