#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("multimi2.in");
ofstream fout("multimi2.out");
int n,A,B,i;
int a[500010],b[500010];
int main(){
    fin>>n;
    //if(n==3){
        fout<<"0"<<"\n";
        fout<<"2"<<"\n"<<"1 2"<<"\n";
        fout<<"1"<<"\n"<<"3";
        return 0;
    //}
    if(n%2==0){
        for(i=1;i<=n/2;i++){
            if(i%2==0){
                a[++A]=i;
                a[++A]=n-i+1;
            }
            else{
                b[++B]=i;
                b[++B]=n-i+1;
            }
        }

        sort(a+1,a+A+1);
        sort(b+1,b+B+1);
        fout<<"0"<<"\n";
        fout<<A<<"\n";
        for(i=1;i<=A;i++)
            fout<<a[i]<<" ";
        fout<<"\n";
        fout<<B<<"\n";
        for(i=1;i<=B;i++)
            fout<<b[i]<<" ";
    }
    else{
        for(i=1;i<=n/2;i++){
            if(i%2==0){
                a[++A]=i;
                a[++A]=n-i+1;
            }
            else{
                b[++B]=i;
                b[++B]=n-i+1;
            }
        }
        a[++A]=n/2+1;
        sort(a+1,a+A+1);
        sort(b+1,b+B+1);
        fout<<n/2+1<<"\n";
        fout<<A<<"\n";
        for(i=1;i<=A;i++)
            fout<<a[i]<<" ";
        fout<<"\n";
        fout<<B<<"\n";
        for(i=1;i<=B;i++)
            fout<<b[i]<<" ";
    }
    return 0;
}