Pagini recente » Cod sursa (job #233563) | Cod sursa (job #1996758) | Cod sursa (job #1433674) | Cod sursa (job #1912412) | Cod sursa (job #1318877)
#include<cstdio>
#include<algorithm>
using namespace std;
int i,j,nr;
bool w[1000005];
long long s1,x,s,n;
int main()
{
freopen("multimi2.in","r",stdin);
freopen("multimi2.out","w",stdout);
scanf("%lld",&n);
s=(n*(n+1))/2;
if (s%2==0) printf("%d\n",0);
else printf("%d\n",1);
s1=s/2; x=n; nr=0;
while (s1>x)
s1-=x,w[x]=1,nr++,x--;
w[s1]=1; nr++;
printf("%d\n",nr);
for (i=1;i<=n;i++) if (w[i])
printf("%d ",i);
printf("\n%d\n",n-nr);
for (i=1;i<=n;i++) if (!w[i])
printf("%d ",i);
return 0;
}