#include <bitset>
using namespace std;
bitset <1000001> v;
long long n,nr,i,j,s1,s2;
int main()
{ freopen("multimi2.in","r",stdin);
freopen("multimi2.out","w",stdout);
scanf("%lld",&n);
s1=n*(n+1)/4; s2=n*(n+1)/2-s1;
printf("%lld\n",s2-s1);
for(j=n; s2>=j; j--) {v[j]=1; s2-=j; nr++;}
if(s2) {v[s2]=1; nr++;}
printf("%lld\n",nr);
for(i=1; i<=n; i++)
if(v[i]) printf("%lld ",i);
printf("\n%lld\n",n-nr);
for(i=1; i<=n; i++)
if(!v[i]) printf("%lld ",i);
printf("\n");
return 0;
}