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


using namespace std ;

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

ifstream fin("lacate.in") ;
ofstream fout("lacate.out") ;

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

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



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

inline void SOLVE()
{
    C = 1 ;
    L = 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()
{

    fout << L - 1 << ' ' << C << "\n" ;

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


}


int main()
{

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


    fin.close() ;
    fout.close() ;
    return 0 ;
}