#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline ll time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

const int N = 1e6;
bool is_not_prime[N];
vector<int> res[N];

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    is_not_prime[0] = is_not_prime[1] = true;
    for(int i=2;i<N;i++){
        if(!is_not_prime[i]){
            for(int j=i+i;j<N;j+=i){
                is_not_prime[j]=true;
            }
        }
    }
    if(!is_not_prime[n]){
        printf("-1\n");
        return 0;
    }
    else if(n%2==0){
        printf("%d\n",n/2);
        int cur=1;
        for(int i=0;i<n/2;i++){
            res[i].push_back(cur);
            cur+=2;
        }
        for(int i=n/2-1;i>=0;i--){
            res[i].push_back(cur);
            cur+=2;
        }
        for(int i=0;i<n/2;i++){
            printf("%d",res[i].size());
            for(int j=0;j<res[i].size();j++){
                printf(" %d",res[i][j]);
            }
            printf("\n");
        }
    }
    else{
        int d;
        for(int i=2;i*i<=n;i++){
            if(n%i==0){
                d=i;
                break;
            }
        }
        printf("%d\n",d);
        int cur=1;
        int id=0;
        for(int i=0;i<d;i++){
            for(int j=0;j<d;j++){
                res[(id+j)%d].push_back(cur+2*d*j);
            }
            cur+=2;
            id++;
        }
        cur=2*d*d+1;
        while(cur<2*n+1){
            for(int i=0;i<d;i++){
                res[i].push_back(cur);
                cur+=2;
            }
            for(int i=d-1;i>=0;i--){
                res[i].push_back(cur);
                cur+=2;
            }
        }
        for(int i=0;i<d;i++){
            printf("%d",res[i].size());
            int sum=0;
            for(int j=0;j<res[i].size();j++){
                printf(" %d",res[i][j]);
                sum+=res[i][j];
            }
            printf("\n");
        }
    }
}