#include<cstdio>
const int N=256;
int a[N+1][N+1];
int k,n;
void init(){
    freopen("lacate.in","r",stdin);
    freopen("lacate.out","w",stdout);
    scanf("%d",&n);
}
void solve(){
    int i,j;
    for(i=1;i<=n;i++){
        for(j=i+1;j<=n;j++){
            a[i][j-1]=++k;
            a[j][i]=k;
        }
    }
}
void print(){
    int i,j;
    printf("%d %d\n",k,n-1);
    for(i=1;i<=n;i++){
        for(j=1;j<n;j++)
            printf("%d ",a[i][j]);
        printf("\n");
    }
}
int main(){
    init();
    solve();
    print();
    return 0;
}