#include <fstream>
#include <vector>
#include <algorithm>


using namespace std ;

const short NMAX = 260 ;
const int INF = 0x3f3f3f3f ;

ifstream cin("lacate.in") ;
ofstream cout("lacate.out") ;

void READ() ;
void SOLVE() ;
void OUT() ;

short N, A[NMAX][NMAX];
short L, C;



inline void READ()
{
    cin >> N ;
}

inline void SOLVE()
{
    L = 1 ;
    C = N - 1 ;
    for(int i = 0; i < C ; ++ i)
      {

        for(int j = i ; j < C ; ++ j){
        A[i][j] = A[j + 1][i] = L ++ ;
      }}
}

inline void OUT()
{

    cout << L - 1 << ' ' << C << '\n' ;

    for(int i = 0 ; i < N; ++ i)
       {for(int j = 0 ; j < C ; ++ j){
           cout << A[i][j] << ' ';
       }
           cout << '\n' ;
       }


}


int main()
{

    READ() ;
    SOLVE() ;
    OUT() ;


    cin.close() ;
    cout.close() ;
    return 0 ;
}