#include //#include //using namespace atcoder; using namespace std; using ll = long long; using vll = vector; using vvll = vector; using vvvll = vector; using vb = vector; using vvb = vector; using vvvb = vector; using vd = vector; using vvd = vector; using vvvd = vector; #define all(A) A.begin(),A.end() #define rep(i, n) for (ll i = 0; i < (ll) (n); i++) using pqr = priority_queue, vector>, greater>>; template bool chmax(T& p, T q) { if (p < q) { p = q; return 1; } else { return 0; } } template bool chmin(T& p, T q) { if (p > q) { p = q; return 1; } else { return 0; } } ll gcd(ll(a), ll(b)) { ll c = a; while (a % b != 0) { c = a % b; a = b; b = c; } return b; } ll modPow(long long a, long long n, long long p) { if (n == 0) return 1; // 0乗にも対応する場合 if (n == 1) return a % p; if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p; long long t = modPow(a, n / 2, p); return (t * t) % p; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll N; cin>>N; cout<<2*N-1<=2*N-j-2){ AN[k][j+1]=j+1; } else{ AN[k][j+1]=2*N-j-2; } } } } rep(i,2*N-1){ rep(k,N){ cout<